Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
From MaRDI portal
Publication:3686428
Recommendations
Cited in
(44)- S3 sets. An extension of the Beale-Tomlin special ordered sets
- IP over 40+ years at IBM scientific centers and marketing
- My experiences as a student and researcher in OR during the 1960's and 70's
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
- The generalized assignment problem: Valid inequalities and facets
- Strategies for LP-based solving a general class of scheduling problems
- Representability in mixed integer programming. I: Characterization results
- On tightening cover induced inequalities
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
- Generalized cover facet inequalities for the generalized assignment problem
- Generalized resolution for 0--1 linear inequalities
- Cutting planes for mixed-integer knapsack polyhedra
- Efficient reformulation for 0-1 programs -- methods and computational results
- Facet defining inequalities for the dichotomous knapsack problem
- Detecting constraint redundancy in 0-1 linear programming problems
- A branch-and-cut approach for the minimum-energy broadcasting problem in wireless networks
- Solving mixed integer programming production planning problems with setups by shadow price information.
- Polylithic modeling and solution approaches using algebraic modeling systems
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
- Satisfying the customer
- A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
- A note on modeling multiple choice requirements for simple mixed integer programming solvers
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Large-scale 0-1 linear programming on distributed workstations
- Measuring the impact of primal heuristics
- Solving large-scale mixed-integer programs with fixed charge variables
- Valid inequalities and facets of the capacitated plant location problem
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- Combinatorial optimization in Nash games
- A solution procedure for general knapsack problems with a few constraints
- A production planning problem in FMS
- Generating cuts in integer programming with families of special ordered sets
- Optimal scrap combination for steel production
- Solving Large-Scale Zero-One Linear Programming Problems
- Supernode processing of mixed-integer models
- A binary integer linear program with multi-criteria and multi-constraint levels
- A facet generation and relaxation technique applied to an assignment problem with side constraints
- Facets and algorithms for capacitated lot sizing
- A conditional logic approach for strengthening mixed 0-1 linear programs
- Logical processing for integer programming
- A technique for speeding up the solution of the Lagrangean dual
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- Modeling and integer programming techniques applied to propositional calculus
This page was built for publication: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686428)
