Influence of the normalization constraint on the integral simplex using decomposition

DOI10.1016/j.dam.2015.12.015zbMath1351.05030OpenAlexW2294401501MaRDI QIDQ729804

François Soumis, Samuel Rosat, Driss Chakour, Issmail El Hallaoui

Publication date: 22 December 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.12.015

zbMATH Keywords

0-1 programmingprimal algorithmsnormalization constraintaugmenting algorithmsset partitioning problem

Mathematics Subject Classification ID

Partitions of sets (05A18) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items

Improved integral simplex using decomposition for the set partitioning problem ⋮ 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 ⋮ Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling ⋮ Integral simplex using double decomposition for set partitioning problems ⋮ Improving set partitioning problem solutions by zooming around an improving direction ⋮ Vector Space Decomposition for Solving Large-Scale Linear Programs ⋮ The minimum mean cycle-canceling algorithm for linear programs

Uses Software

• ISUD

Cites Work

• Unnamed Item
• Unnamed Item
• All-integer column generation for set partitioning: basic principles and extensions
• Column generation in the integral simplex method
• Primal cutting plane algorithms revisited
• A primal all-integer algorithm based on irreducible solutions
• Dynamic constraint and variable aggregation in column generation
• Integral simplex using decomposition with primal cutting planes
• An integral simplex algorithm for solving combinatorial optimization problems
• Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis
• 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
• Finding minimum-cost circulations by canceling negative cycles
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• The Set-Partitioning Problem: Set Covering with Equality Constraints
• The Complexity of Generic Primal Algorithms for Solving General Integer Programs

This page was built for publication: Influence of the normalization constraint on the integral simplex using decomposition