Improved integral simplex using decomposition for the set partitioning problem

DOI10.1007/s13675-018-0098-6zbMath1409.90162OpenAlexW2803699435MaRDI QIDQ1616829

Issmail El Hallaoui, Abdelouahab Zaghrouti, François Soumis

Publication date: 7 November 2018

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-018-0098-6

zbMATH Keywords

primal algorithmsset partitioning problemintegral simplex

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

Integral Column Generation for Set Partitioning Problems with Side Constraints

Uses Software

• ISUD

Cites Work

• Influence of the normalization constraint on the integral simplex using decomposition
• Column generation in the integral simplex method
• The integral basis method for integer programming
• An integral simplex algorithm for solving combinatorial optimization problems
• Integral Simplex Using Decomposition for the Set Partitioning Problem
• An Improved Primal Simplex Algorithm for Degenerate Linear Programs
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• On the Set-Covering Problem

This page was built for publication: Improved integral simplex using decomposition for the set partitioning problem