Penalty computations for the set partitioning problem

DOI10.1007/BF02025299MaRDI QIDQ1309877zbMATH OpenOpenAlexFDO

Authors Brigitte Jaumard, Marcelo Prais, Celso C. Ribeiro

Publication date 20 December 1993

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02025299

zbMATH Keywords

computation of penaltiescontinuous relaxation of integer programming problemspreprocessingset partitioning

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09) Combinatorial optimization (90C27)

Recommendations

• On the calculation of true and pseudo penalties in multiple choice integer programming
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
• A Multiplier Adjustment Approach for the Set Partitioning Problem
• scientific article; zbMATH DE number 3970518
• An exact penalty function approach for nonlinear integer programming problems

Cites work

• A Branch-and-Bound Method for the Fixed Charge Transportation Problem
• An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
• scientific article; zbMATH DE number 3526452 (Why is no real title available?)
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
• Improved penalty calculations for a mixed integer branch-and-bound algorithm
• Some branch-and-bound procedures for fixed-cost transportation problems
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• Traffic assignment in communication satellites
• Use of penalties in a branch and bound procedure for the fixed charge transportation problem

Cited in

(2)

• On the calculation of true and pseudo penalties in multiple choice integer programming
• A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm

Describes a project that uses

Uses Software

• LINDO
• XMP

This page was built for publication: Penalty computations for the set partitioning problem

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