A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem.
- Published in:
- Mathematical Programming, 2006, v. 105, n. 1, p. 55, doi. 10.1007/s10107-005-0572-9
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2006 AND VI 105 AND IP 1
Results: 7
1
2
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut.
- Published in:
- Mathematical Programming, 2006, v. 105, n. 1, p. 85, doi. 10.1007/s10107-005-0576-5
- By:
- Publication type:
- Article
3
Optimization-based simulation of nonsmooth rigid multibody dynamics.
- Published in:
- Mathematical Programming, 2006, v. 105, n. 1, p. 113, doi. 10.1007/s10107-005-0590-7
- By:
- Publication type:
- Article
4
The level set method of Joó and its use in minimax theory.
- Published in:
- Mathematical Programming, 2006, v. 105, n. 1, p. 145, doi. 10.1007/s10107-005-0591-6
- By:
- Publication type:
- Article
5
Approximate fixed-rank closures of covering problems.
- Published in:
- Mathematical Programming, 2006, v. 105, n. 1, p. 9, doi. 10.1007/s10107-005-0598-z
- By:
- Publication type:
- Article
6
Valid inequalities based on simple mixed-integer sets.
- Published in:
- Mathematical Programming, 2006, v. 105, n. 1, p. 29, doi. 10.1007/s10107-005-0599-y
- By:
- Publication type:
- Article
7
George B. Dantzig: a legendary life in mathematical programming.
- Published in:
- Mathematical Programming, 2006, v. 105, n. 1, p. 1, doi. 10.1007/s10107-005-0674-4
- By:
- Publication type:
- Article