Penalty computations for the set partitioning problem

DOI10.1007/BF02025299zbMath0784.90061OpenAlexW2921739519MaRDI QIDQ1309877

Celso Carneiro Ribeiro, Brigitte Jaumard, Marcelo Prais

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

set partitioningpreprocessingcomputation of penaltiescontinuous relaxation of integer programming problems

Mathematics Subject Classification ID

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

Related Items (1)

A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm

Uses Software

• LINDO
• XMP

Cites Work

• Unnamed Item
• Traffic assignment in communication satellites
• Use of penalties in a branch and bound procedure for the fixed charge transportation problem
• An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
• Some branch-and-bound procedures for fixed-cost transportation problems
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
• Improved penalty calculations for a mixed integer branch-and-bound algorithm
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem

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