Pages that link to "Item:Q4025902"

The following pages link to Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut (Q4025902):

Displaying 38 items.

• Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
• Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
• Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
• A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
• Logical processing for integer programming (Q817209) (← links)
• Airline crew scheduling: state-of-the-art (Q817210) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
• Coefficient strengthening: a tool for reformulating mixed-integer programs (Q847848) (← links)
• Progress in presolving for mixed integer programming (Q903920) (← links)
• \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
• Minimum cost capacity installation for multicommodity network flows (Q1290614) (← links)
• Cutting planes for mixed-integer knapsack polyhedra (Q1290620) (← links)
• A procedure for optimizing tactical response in oil spill clean up operations (Q1290711) (← links)
• Computational implementation of Fujishige's graph realizability algorithm (Q1296050) (← links)
• On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint (Q1304779) (← links)
• Solving \(0/1\) integer programs with enumeration cutting planes (Q1339119) (← links)
• Optimizing single-terminal dispatch of large volume trips to trucks (Q1339147) (← links)
• Supernode processing of mixed-integer models (Q1342883) (← links)
• Binary integer programs with two variables per inequality (Q1363421) (← links)
• Evolution and state-of-the-art in integer programming (Q1593833) (← links)
• Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
• Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
• On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs (Q1814812) (← links)
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
• Air cargo scheduling: integrated models and solution procedures (Q1944877) (← links)
• Conflict graphs in solving integer programming problems (Q1969889) (← links)
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
• On lifted cover inequalities: a new lifting procedure with unusual properties (Q2294273) (← links)
• Dominance breaking constraints (Q2342647) (← links)
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
• Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
• Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
• Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)