Integral simplex using decomposition with primal cutting planes
type: Item
instance of: scholarly article
title: Integral simplex using decomposition with primal cutting planes
zbMATH Open document ID: 1379.90015
author: Samuel Rosat
author: Issmail Elhallaoui
author: François Soumis
author: Andrea Lodi
published in: Mathematical Programming. Series A. Series B
publication date: 2017-12-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 6814732
zbMATH Keywords: \(\{0, 1\}\)-programming
zbMATH Keywords: integral simplex
zbMATH Keywords: primal algorithms
zbMATH Keywords: set partitioning
zbMATH Keywords: primal cutting-planes
zbMATH Keywords: scheduling
describes a project that uses: ISUD
MaRDI profile type: Publication
full work available at URL: s10107-017-1123-x
OpenAlex ID: W2595226875
cites work: On the Set-Covering Problem: II. An Algorithm for Set Partitioning
cites work: A unified exact method for solving different classes of vehicle routing problems
cites work: Q5508060
cites work: Q5687193
cites work: Primal separation for 0/1 polytopes
cites work: An improved primal simplex algorithm for degenerate linear programs
cites work: Multi-phase dynamic constraint aggregation for set partitioning type problems
cites work: The Set-Partitioning Problem: Set Covering with Equality Constraints
cites work: A New Foundation for a Simplified Primal Integer Programming Algorithm
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: A primal all-integer algorithm based on irreducible solutions
cites work: A class of methods for linear programming
cites work: Primal cutting plane algorithms revisited
cites work: Q4414642
cites work: Primal separation algorithms
cites work: Column generation decomposition with the degenerate constraints in the subproblem
cites work: The positive edge criterion within COIN-OR's CLP
cites work: Q4547547
cites work: On the facial structure of set packing polyhedra
cites work: Column generation in the integral simplex method
cites work: All-integer column generation for set partitioning: basic principles and extensions
cites work: Influence of the normalization constraint on the integral simplex using decomposition
cites work: Solving the electricity production planning problem by a column generation based heuristic
cites work: Set Covering by an All Integer Algorithm
cites work: 0/1-Integer programming: Optimization and Augmentation are equivalent
cites work: Q5292087
cites work: The operational airline crew scheduling problem
cites work: An integral simplex algorithm for solving combinatorial optimization problems
cites work: Q5611528
cites work: A primal (all-integer) integer programming algorithm
cites work: A Simplified Primal (All-Integer) Integer Programming Algorithm
cites work: Integral simplex using decomposition for the set partitioning problem
DOI: 10.1007/S10107-017-1123-X
description: scientific article; zbMATH DE number 6814732