Solving Large-Scale Zero-One Linear Programming Problems
From MaRDI portal
Recommendations
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- scientific article; zbMATH DE number 710403
- scientific article; zbMATH DE number 4001344
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving \(0/1\) integer programs with enumeration cutting planes
Cited in
(only showing first 100 items - show all)- Bidimensional packing by bilinear programming
- Solving multiple scenarios in a combinatorial auction
- A note on solving large p-median problems
- Location problems
- Valid inequalities for mixed 0-1 programs
- Exact methods for the knapsack problem and its generalizations
- Representability in mixed integer programming. I: Characterization results
- A simple strategy for solving a class of 0-1 integer programming models
- Global minimization of indefinite quadratic problems
- Adding activities to the dual instead of cuts to the primal problem
- Some branch and bound techniques for nonlinear optimization
- S3 sets. An extension of the Beale-Tomlin special ordered sets
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- A note on the pivot and complement heuristic for 0-1 programming problems
- Strong formulations for mixed integer programming: A survey
- Facets and lifting procedures for the set covering polytope
- \(O(n \log n)\) procedures for tightening cover inequalities
- A note on the knapsack problem with special ordered sets
- Finding minimum cost directed trees with demands and capacities
- A characterization of knapsacks with the max-flow--min-cut property
- On tightening cover induced inequalities
- The complexity of lifted inequalities for the knapsack problem
- Polyhedral results for the precedence-constrained knapsack problem
- Valid inequalities and facets of the capacitated plant location problem
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Optimizing nuclear power plant refueling with mixed-integer programming
- Cutting planes for integer programs with general integer variables
- Cutting planes for mixed-integer knapsack polyhedra
- A procedure for optimizing tactical response in oil spill clean up operations
- Different transformations for solving non-convex trim-loss problems by MINLP
- Solving the generalised assignment problem using polyhedral results
- Cost optimal allocation of rail passenger lines
- The complexity of cover inequality separation
- Order selection on a single machine with high set-up costs
- A technique for speeding up the solution of the Lagrangean dual
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
- Partial cover and complete cover inequalities
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- Solving \(0/1\) integer programs with enumeration cutting planes
- Supernode processing of mixed-integer models
- Binary integer programs with two variables per inequality
- Some properties of cliques in 0-1 mixed integer programs
- A binary integer linear program with multi-criteria and multi-constraint levels
- Progress with single-item lot-sizing
- Solving mixed integer programming production planning problems with setups by shadow price information.
- Foundation-penalty cuts for mixed-integer programs.
- Preprocessing and cutting for multiple allocation hub location problems.
- Valid inequalities for a class of assembly system problems
- Evolution and state-of-the-art in integer programming
- Theoretical challenges towards cutting-plane selection
- Domain reduction techniques for global NLP and MINLP optimization
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Partial convexification cuts for 0--1 mixed-integer programs
- A polyhedral study of nonconvex quadratic programs with box constraints
- Benders decomposition: solving binary master problems by enumeration
- Optimization algorithms for the disjunctively constrained knapsack problem
- Efficient reformulation for 0-1 programs -- methods and computational results
- Deterministic network interdiction
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- On identifying dominant cliques.
- Cutting-plane proofs in polynomial space
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
- Future paths for integer programming and links to artificial intelligence
- Facets and algorithms for capacitated lot sizing
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- Reliability, covering and balanced matrices
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
- Cardinality-restricted chains and antichains in partially ordered sets
- Long range planning in the process industries: A projection approach
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
- Valid integer polytope (VIP) penalties for branch-and-bound enumeration
- Strong IP formulations need large coefficients
- Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization
- Multi-cover inequalities for totally-ordered multiple knapsack sets
- The aggregation closure is polyhedral for packing and covering integer programs
- On the exact separation of cover inequalities of maximum-depth
- On a generalization of the Chvátal-Gomory closure
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- The strength of multi-row aggregation cuts for sign-pattern integer programs
- On lifted cover inequalities: a new lifting procedure with unusual properties
- ``Facet separation with one linear program
- New SOCP relaxation and branching rule for bipartite bilinear programs
- Data-driven construction of convex region surrogate models
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A distributed exact algorithm for the multiple resource constrained sequencing problem
- Local cuts for mixed-integer programming
- Polytopes associated with symmetry handling
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
This page was built for publication: Solving Large-Scale Zero-One Linear Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3696859)
