Preprocessing rules for integer programming solutions to the generalised assignment problem

DOI10.1057/PALGRAVE.JORS.2601111MaRDI QIDQ4658442zbMATH OpenOpenAlexFDO

Authors

Publication date 16 March 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601111

zbMATH Keywords

assignmentheuristicsoptimisationpreprocessing rules

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Solving the generalised assignment problem using polyhedral results
• scientific article; zbMATH DE number 3892937
• Approximability of Integer Programming with Generalised Constraints
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Solution of a class of generalized assignment problem
• scientific article; zbMATH DE number 1263271
• scientific article; zbMATH DE number 710403
• Generalised Integer Programming Based on Logically Defined Relations
• scientific article; zbMATH DE number 781263
• General purpose heuristics for integer programming. I

Cited in

(3)

• Modelling of augmented makespan assignment problems (AMAPs): Computational experience of applying integer presolve at the modelling stage
• Petroleum refinery optimization
• A constraint programming approach for the premarshalling problem

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: Preprocessing rules for integer programming solutions to the generalised assignment problem

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