IP over 40+ years at IBM scientific centers and marketing
From MaRDI portal
Publication:537612
DOI10.1007/s10479-006-0095-7zbMath1213.90030OpenAlexW2018836317MaRDI QIDQ537612
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-0095-7
Integer programming (90C10) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)
Cites Work
- Unnamed Item
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- Local branching
- An Automatic Method of Solving Discrete Programming Problems
- Fixed-cost transportation problems
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Enumerative Methods in Integer Programming
- Integer Programming: Methods, Uses, Computations
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Algorithms for the Simple Plant-Location Problem with Some Side Conditions
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
This page was built for publication: IP over 40+ years at IBM scientific centers and marketing