Improved integral simplex using decomposition for the set partitioning problem
type: Item
instance of: scholarly article
title: Improved integral simplex using decomposition for the set partitioning problem
zbMATH Open document ID: 1409.90162
author: Abdelouahab Zaghrouti
author: Issmail Elhallaoui
author: François Soumis
published in: EURO Journal on Computational Optimization
publication date: 2018-11-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6974526
zbMATH Keywords: primal algorithms
zbMATH Keywords: set partitioning problem
zbMATH Keywords: integral simplex
describes a project that uses: ISUD
MaRDI profile type: Publication
full work available at URL: s13675-018-0098-6
OpenAlex ID: W2803699435
cites work: On the Set-Covering Problem
cites work: On the Set-Covering Problem: II. An Algorithm for Set Partitioning
cites work: An improved primal simplex algorithm for degenerate linear programs
cites work: The integral basis method for integer programming
cites work: Column generation in the integral simplex method
cites work: Influence of the normalization constraint on the integral simplex using decomposition
cites work: An integral simplex algorithm for solving combinatorial optimization problems
cites work: Integral simplex using decomposition for the set partitioning problem
Wikidata QID: Q129890175
DOI: 10.1007/S13675-018-0098-6
Recommended article: Integral simplex using decomposition for the set partitioning problem
Recommended article: Integral simplex using double decomposition for set partitioning problems
Recommended article: Integral simplex methods for the set partitioning problem: globalisation and anti-cycling
Recommended article: An integral simplex algorithm for solving combinatorial optimization problems
Recommended article: Improved Lagrangean decomposition: An application to the generalized assignment problem
Recommended article: Partitioning and decomposition in combinatorial optimization
Recommended article: A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
Recommended article: An improved partial enumeration algorithm for integer programming problems
description: scientific article; zbMATH DE number 6974526