Influence of the normalization constraint on the integral simplex using decomposition

DOI10.1016/J.DAM.2015.12.015MaRDI QIDQ729804zbMATH OpenOpenAlexFDO

Authors Samuel Rosat, François Soumis, Driss Chakour, Issmail Elhallaoui

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 programmingaugmenting algorithmsnormalization constraintprimal algorithmsset partitioning problem

Mathematics Subject Classification ID

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

Recommendations

• Integral simplex using decomposition for the set partitioning problem
• Improved integral simplex using decomposition for the set partitioning problem
• Integral simplex using double decomposition for set partitioning problems
• Integral simplex using decomposition with primal cutting planes
• Improving set partitioning problem solutions by zooming around an improving direction

Cites work

• A primal all-integer algorithm based on irreducible solutions
• All-integer column generation for set partitioning: basic principles and extensions
• An improved primal simplex algorithm for degenerate linear programs
• An integral simplex algorithm for solving combinatorial optimization problems
• Column generation in the integral simplex method
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• Dynamic constraint and variable aggregation in column generation
• Finding minimum-cost circulations by canceling negative cycles
• scientific article; zbMATH DE number 3333883 (Why is no real title available?)
• Improved primal simplex: a more general theoretical framework and an extended experimental analysis
• Integral simplex using decomposition for the set partitioning problem
• Integral simplex using decomposition with primal cutting planes
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• Outline of an algorithm for integer solutions to linear programs
• Primal cutting plane algorithms revisited
• Primal integer programming
• The Complexity of Generic Primal Algorithms for Solving General Integer Programs
• The Set-Partitioning Problem: Set Covering with Equality Constraints

Cited in

(10)

• Improved integral simplex using decomposition for the set partitioning problem
• Integral simplex using decomposition with primal cutting planes
• Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling
• The minimum mean cycle-canceling algorithm for linear programs
• Distributed integral column generation for set partitioning problems
• Integral simplex using double decomposition for set partitioning problems
• Improving set partitioning problem solutions by zooming around an improving direction
• Integral simplex using decomposition for the set partitioning problem
• Vector Space Decomposition for Solving Large-Scale Linear Programs
• Integral Column Generation for Set Partitioning Problems with Side Constraints

Describes a project that uses

Uses Software

• ISUD

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q729804)