Efficient reformulation for 0-1 programs -- methods and computational results
From MaRDI portal
Publication:1803672
DOI10.1016/0166-218X(93)90044-OzbMATH Open0776.90056MaRDI QIDQ1803672FDOQ1803672
Brenda L. Dietrich, Laureano F. Escudero Bueno, F. Chance
Publication date: 29 June 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
- A note for tightening 0-1 models
cutting planescapacity expansionminimal coversknapsackmaximal cliquesvariable upper bounding constraintscoefficient reductionclique and cover induced inequalities
Cites Work
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Title not available (Why is that?)
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Easily Computable Facets of the Knapsack Polytope
- Outline of an algorithm for integer solutions to linear programs
- Solving Large-Scale Zero-One Linear Programming Problems
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Title not available (Why is that?)
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
- A New Algorithm for the 0-1 Knapsack Problem
- An algorithm for the solution of the 0-1 knapsack problem
- On tightening cover induced inequalities
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
- Technical Note—A Note on Zero-One Programming
- S3 sets. An extension of the Beale-Tomlin special ordered sets
- Solving large-scale mixed-integer programs with fixed charge variables
- Coefficient reduction for inequalities in 0–1 variables
- Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions
- Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
- Generating cuts in integer programming with families of special ordered sets
- Strong formulations for mixed integer programming: A survey
- Technical Note—Stronger Inequalities for 0-1 Integer Programming: Computational Refinements
- \(0\)-\(1\) knapsack problems with a side constraint
Cited In (19)
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
- On identifying dominant cliques.
- A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems
- Some of my favorite integer programming applications at IBM
- Coefficient strengthening: a tool for reformulating mixed-integer programs
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
- A new idea on the interval-symbol method with correct zero rewriting for reducing exact computations
- Order selection on a single machine with high set-up costs
- \(O(n \log n)\) procedures for tightening cover inequalities
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- On surrogating 0-1 knapsack constraints
- A note for tightening 0-1 models
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- Supernode processing of mixed-integer models
- Some properties of cliques in 0-1 mixed integer programs
- A conditional logic approach for strengthening mixed 0-1 linear programs
Uses Software
This page was built for publication: Efficient reformulation for 0-1 programs -- methods and computational results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803672)
