Pages that link to "Item:Q3256638"
From MaRDI portal
The following pages link to Outline of an algorithm for integer solutions to linear programs (Q3256638):
Displayed 37 items.
- Spherical cuts for integer programming problems (Q3499437) (← links)
- Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows (Q3564367) (← links)
- Resolution Width and Cutting Plane Rank Are Incomparable (Q3599159) (← links)
- Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
- Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming (Q4971025) (← links)
- On a Generalization of the Chvátal-Gomory Closure (Q5041739) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- (Q5092485) (← links)
- Optimal Cutting Planes from the Group Relaxations (Q5108238) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← 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)
- A simple effective heuristic for embedded mixed-integer quadratic programming (Q5207801) (← links)
- CUTTING PLANE WITH NON-UNIFORM DISTRIBUTIONS (Q5215104) (← links)
- Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow (Q5256763) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- Virtual private network design over the first Chvátal closure (Q5501875) (← links)
- A model for discrete-variable linear programming (Q5511853) (← links)
- On some sequencing problems (Q5548720) (← links)
- Rückgerechnete Duale Variable (Q5558778) (← links)
- (Q5860583) (← links)
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS (Q5880744) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective (Q6057717) (← links)
- Foundations of operations research: from linear programming to data envelopment analysis (Q6106760) (← links)
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
- Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming (Q6173941) (← links)