Logical processing for integer programming
From MaRDI portal
Publication:817209
DOI10.1007/s10479-005-3974-4zbMath1091.90050OpenAlexW2036201113MaRDI QIDQ817209
Ellis L. Johnson, Monique Guignard, Kurt Spielberg
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3974-4
disaggregationinteger programmingprobingcovers of low degreesdouble contractionlogical processingpersistence of signsreduction schemesreduction to minimal preferred inequalities
Integer programming (90C10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A conditional logic approach for strengthening mixed 0-1 linear programs
- Logical processing for integer programming
- Airline crew scheduling: state-of-the-art
- Partitioning procedures for solving mixed-variables programming problems
- Applying a modified coefficient reduction method to a dynamic production scheduling model
- On tightening cover induced inequalities
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
- Local branching
- Model tightening for integrated timber harvest and transportation planning
- Outline of an algorithm for integer solutions to linear programs
- An Automatic Method of Solving Discrete Programming Problems
- Fixed-cost transportation problems
- A Note on Coefficient Adjustment Using Sos Constraints
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Routing with time windows by column generation
- Solving Large-Scale Zero-One Linear Programming Problems
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- An analysis of approximations for maximizing submodular set functions—I
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- A global approach to crew-pairing optimization
- Integer Programming: Methods, Uses, Computations
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Algorithms for the Simple Plant-Location Problem with Some Side Conditions
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Flows in Arborescences
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
- A Note on Extreme-Point Solutions and A Paper by Lemke, Salkin, and Spielberg
- Generalized implicit enumeration using bounds on variables for solving linear programs with zero‐one variables
