Integral simplex using decomposition with primal cutting planes

DOI10.1007/s10107-017-1123-xzbMath1379.90015OpenAlexW2595226875MaRDI QIDQ1683694

Andrea Lodi, François Soumis, Samuel Rosat, Issmail El Hallaoui

Publication date: 1 December 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-017-1123-x

zbMATH Keywords

schedulingset partitioningprimal algorithmsintegral simplex\(\{0, 1\}\)-programmingprimal cutting-planes

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items

Distributed integral column generation for set partitioning problems, Integral simplex using decomposition with primal cutting planes, Integral Column Generation for Set Partitioning Problems with Side Constraints, Integral simplex using double decomposition for set partitioning problems, Influence of the normalization constraint on the integral simplex using decomposition, Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis, Improving set partitioning problem solutions by zooming around an improving direction

Uses Software

• ISUD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• All-integer column generation for set partitioning: basic principles and extensions
• The positive edge criterion within COIN-OR's CLP
• Influence of the normalization constraint on the integral simplex using decomposition
• Column generation in the integral simplex method
• Multi-phase dynamic constraint aggregation for set partitioning type problems
• Column generation decomposition with the degenerate constraints in the subproblem
• Primal separation for 0/1 polytopes
• Primal cutting plane algorithms revisited
• Primal separation algorithms
• A primal all-integer algorithm based on irreducible solutions
• Integral simplex using decomposition with primal cutting planes
• An integral simplex algorithm for solving combinatorial optimization problems
• A unified exact method for solving different classes of vehicle routing problems
• Solving the electricity production planning problem by a column generation based heuristic
• The Operational Airline Crew Scheduling Problem
• Integral Simplex Using Decomposition for the Set Partitioning Problem
• An Improved Primal Simplex Algorithm for Degenerate Linear Programs
• Outline of an algorithm for integer solutions to linear programs
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• A class of methods for linear programming
• On the facial structure of set packing polyhedra
• A Simplified Primal (All-Integer) Integer Programming Algorithm
• A New Foundation for a Simplified Primal Integer Programming Algorithm
• The Set-Partitioning Problem: Set Covering with Equality Constraints
• A primal (all-integer) integer programming algorithm
• Set Covering by an All Integer Algorithm
• 0/1-Integer programming: Optimization and Augmentation are equivalent