Pages that link to "Item:Q1290616"
From MaRDI portal
The following pages link to Cutting planes for integer programs with general integer variables (Q1290616):
Displaying 31 items.
- A computational comparison of Gomory and knapsack cuts (Q580177) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane (Q870164) (← links)
- Generating cuts in integer programming with families of special ordered sets (Q922293) (← links)
- Cutting plane algorithms for the inverse mixed integer linear programming problem (Q1015310) (← links)
- A surrogate cutting plane algorithm for all-integer programming (Q1086159) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- A cutting-plane approach to mixed 0-1 stochastic integer programs (Q1278962) (← links)
- A hybrid approach for biobjective optimization (Q1662163) (← links)
- Constrained integer fractional programming problem with box constraints (Q1689256) (← links)
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← links)
- Solving the facility location and fixed charge solid transportation problem (Q1983711) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
- Multistage robust discrete optimization via quantified integer programming (Q2669532) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments (Q3499436) (← links)
- On the redundancy of cutting planes for linear complementarity problems (Q3716850) (← links)
- Fenchel Cutting Planes for Integer Programs (Q4287599) (← links)
- Completeness of cutting planes revisited (Q5224684) (← links)
- Computational Integer Programming and Cutting Planes (Q5292084) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- A disjunctive cutting plane procedure for general mixed-integer linear programs (Q5930736) (← links)
- A framework for constructing general integer problems with well-determined duality gaps (Q5955093) (← links)
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective (Q6057717) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
