Pages that link to "Item:Q3686428"
From MaRDI portal
The following pages link to Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models (Q3686428):
Displayed 33 items.
- Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
- A facet generation and relaxation technique applied to an assignment problem with side constraints (Q810374) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- Logical processing for integer programming (Q817209) (← links)
- A solution procedure for general knapsack problems with a few constraints (Q908852) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- Facet defining inequalities for the dichotomous knapsack problem (Q911989) (← links)
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds (Q914548) (← links)
- A production planning problem in FMS (Q917423) (← links)
- Modeling and integer programming techniques applied to propositional calculus (Q918954) (← links)
- Generating cuts in integer programming with families of special ordered sets (Q922293) (← links)
- Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
- S3 sets. An extension of the Beale-Tomlin special ordered sets (Q1102852) (← links)
- On tightening cover induced inequalities (Q1199516) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- Optimal scrap combination for steel production (Q1286779) (← links)
- Cutting planes for mixed-integer knapsack polyhedra (Q1290620) (← links)
- A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← 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)
- A binary integer linear program with multi-criteria and multi-constraint levels (Q1373885) (← links)
- Solving mixed integer programming production planning problems with setups by shadow price information. (Q1406717) (← links)
- Combinatorial optimization in Nash games (Q1802492) (← 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)
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- A note on modeling multiple choice requirements for simple mixed integer programming solvers (Q2563892) (← links)
- Strategies for LP-based solving a general class of scheduling problems (Q3468869) (← links)
- Generalized cover facet inequalities for the generalized assignment problem (Q3553764) (← links)
- Solving large-scale mixed-integer programs with fixed charge variables (Q3680611) (← links)