ILP and CP formulations for the lazy bureaucrat problem

DOI10.1007/978-3-319-18008-3_18MaRDI QIDQ5741471zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Fabio Furini, Ivana Ljubić, Markus Sinnl

Publication date 25 July 2016

Published in Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18008-3_18

zbMATH Keywords

knapsack problem, polynomial greedy heuristics

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 2185608
• The lazy bureaucrat scheduling problem
• Algorithms and Data Structures
• On lazy bureaucrat scheduling with common deadlines
• scientific article; zbMATH DE number 2089207

Cited in

(2)

• An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
• Generalized Chvátal-Gomory closures for integer programs with bounds on variables

This page was built for publication: ILP and CP formulations for the lazy bureaucrat problem

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