Pages that link to "Item:Q3899820"
From MaRDI portal
The following pages link to Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables (Q3899820):
Displayed 31 items.
- Mixed integer programming: A historical perspective with Xpress-MP (Q537574) (← links)
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- IP over 40+ years at IBM scientific centers and marketing (Q537612) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Integer-programming software systems (Q817202) (← links)
- Logical processing for integer programming (Q817209) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- Uniquely solvable quadratic Boolean equations (Q1070255) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts (Q1328648) (← links)
- Supernode processing of mixed-integer models (Q1342883) (← links)
- Generalized resolution for 0--1 linear inequalities (Q1354004) (← links)
- Binary integer programs with two variables per inequality (Q1363421) (← links)
- Some properties of cliques in 0-1 mixed integer programs (Q1367871) (← links)
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (Q1410308) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
- Model tightening for integrated timber harvest and transportation planning (Q1806856) (← links)
- On identifying dominant cliques. (Q1811147) (← links)
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs (Q1814812) (← links)
- Conflict graphs in solving integer programming problems (Q1969889) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (Q3730348) (← links)
- A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems (Q5101409) (← links)