Some of my favorite integer programming applications at IBM

DOI10.1007/S10479-006-0102-ZMaRDI QIDQ537591zbMATH OpenOpenAlexFDO

Authors Brenda L. Dietrich

Publication date 20 May 2011

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

Full work available at URL https://doi.org/10.1007/s10479-006-0102-z

Mathematics Subject Classification ID

Integer programming (90C10) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)

Cites work

• scientific article; zbMATH DE number 432782 (Why is no real title available?)
• scientific article; zbMATH DE number 3272833 (Why is no real title available?)
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• CMIT, capacitated multi-level implosion tool
• Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
• Efficient reformulation for 0-1 programs -- methods and computational results
• Monge sequences, antimatroids, and the transportation problem with forbidden arcs
• New Procedures For Preprocessing 0–1 Models With Knapsack-Like Constraints And Conjunctive And/Or Disjunctive Variable Upper Bounds
• Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
• On modelling the maximum workload allocation for parallel unrelated machines with setups
• On tightening cover induced inequalities
• Resource allocation among competing activities: A lexicographic minimax approach
• Solving Large-Scale Zero-One Linear Programming Problems

Describes a project that uses

Uses Software

• CMIT
• COIN-OR

This page was built for publication: Some of my favorite integer programming applications at IBM

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