Pages that link to "Item:Q2557712"
From MaRDI portal
The following pages link to Edmonds polytopes and a hierarchy of combinatorial problems (Q2557712):
Displaying 50 items.
- Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
- Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone (Q3457190) (← links)
- Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows (Q3564367) (← links)
- Cutting Planes and the Parameter Cutwidth (Q3576046) (← links)
- Resolution Width and Cutting Plane Rank Are Incomparable (Q3599159) (← links)
- LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
- Sensitivity theorems in integer linear programming (Q3793940) (← links)
- Integer programming duality: Price functions and sensitivity analysis (Q3908768) (← links)
- The value function of an integer program (Q3941194) (← links)
- Semiantichains and Unichain Coverings in Direct Products of Partial Orders (Q3966188) (← links)
- Vertex packings: Structural properties and algorithms (Q4074668) (← links)
- Facet of regular 0–1 polytopes (Q4074672) (← links)
- Lineare Charakterisierungen von Travelling Salesman Problemen (Q4119037) (← links)
- Lower bounds for cutting planes proofs with small coefficients (Q4372903) (← links)
- Lower bounds for resolution and cutting plane proofs and monotone computations (Q4372917) (← links)
- A branch and bound algorithm for the minimum storage-time sequencing problem (Q4434517) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Transitive packing (Q4645940) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- Two algorithms to get strong Gomory cuts (Q4731009) (← links)
- Discrete subadditive functions as Gomory functions (Q4843582) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- On a Generalization of the Chvátal-Gomory Closure (Q5041739) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- (Q5092485) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope (Q5176373) (← links)
- Cutting to the Chase Solving Linear Integer Arithmetic (Q5200035) (← links)
- Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank (Q5219666) (← links)
- Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow (Q5256763) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- Virtual private network design over the first Chvátal closure (Q5501875) (← links)
- Edmonds polytopes and weakly hamiltonian graphs (Q5685112) (← links)
- (Q5743477) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
- Valid Inequalities and Separation Algorithms for the Set Partitioning Problem (Q6160432) (← links)
- A knapsack intersection hierarchy (Q6161286) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 (Q6544493) (← links)
- Routing and scheduling of platform supply vessels in offshore oil and gas logistics (Q6551169) (← links)
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators (Q6561224) (← links)
- Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)
- Enhancing cut selection through reinforcement learning (Q6564771) (← links)
