Some of my favorite integer programming applications at IBM
From MaRDI portal
Publication:537591
DOI10.1007/S10479-006-0102-ZzbMATH Open1213.90017OpenAlexW2029549831MaRDI QIDQ537591FDOQ537591
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
Integer programming (90C10) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)
Cites Work
- CMIT, capacitated multi-level implosion tool
- Solving Large-Scale Zero-One Linear Programming Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resource allocation among competing activities: A lexicographic minimax approach
- On tightening cover induced inequalities
- On modelling the maximum workload allocation for parallel unrelated machines with setups
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
- Efficient reformulation for 0-1 programs -- methods and computational results
- Title not available (Why is that?)
- New Procedures For Preprocessing 0–1 Models With Knapsack-Like Constraints And Conjunctive And/Or Disjunctive Variable Upper Bounds
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs
Uses Software
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)
