Polyhedral properties for the intersection of two knapsacks.
- Published in:
- Mathematical Programming, 2008, v. 113, n. 1, p. 15, doi. 10.1007/s10107-006-0045-9
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2008 AND VI 113 AND IP 1
Results: 6
1
2
Higher order Moreau’s sweeping process: mathematical formulation and numerical simulation.
- Published in:
- Mathematical Programming, 2008, v. 113, n. 1, p. 133, doi. 10.1007/s10107-006-0041-0
- By:
- Publication type:
- Article
3
How good are interior point methods? Klee–Minty cubes tighten iteration-complexity bounds.
- Published in:
- Mathematical Programming, 2008, v. 113, n. 1, p. 1, doi. 10.1007/s10107-006-0044-x
- By:
- Publication type:
- Article
4
Aggregation and discretization in multistage stochastic programming.
- Published in:
- Mathematical Programming, 2008, v. 113, n. 1, p. 61, doi. 10.1007/s10107-006-0048-6
- By:
- Publication type:
- Article
5
Traveling salesman path problems.
- Published in:
- Mathematical Programming, 2008, v. 113, n. 1, p. 39, doi. 10.1007/s10107-006-0046-8
- By:
- Publication type:
- Article
6
The duality of option investment strategies for hedge funds.
- Published in:
- Mathematical Programming, 2008, v. 113, n. 1, p. 95, doi. 10.1007/s10107-007-0198-1
- By:
- Publication type:
- Article