A new path-based cutting plane approach for the discrete time-cost tradeoff problem.
- Published in:
- Computational Management Science, 2010, v. 7, n. 3, p. 313, doi. 10.1007/s10287-009-0115-6
- By:
- Publication type:
- Article
Works matching IS 1619697X AND DT 2010 AND VI 7 AND IP 3
Results: 6
1
2
Reformulations and solution algorithms for the maximum leaf spanning tree problem.
- Published in:
- Computational Management Science, 2010, v. 7, n. 3, p. 289, doi. 10.1007/s10287-009-0116-5
- By:
- Publication type:
- Article
3
An exact solution framework for a broad class of vehicle routing problems.
- Published in:
- Computational Management Science, 2010, v. 7, n. 3, p. 229, doi. 10.1007/s10287-009-0118-3
- By:
- Publication type:
- Article
4
Foreword.
- Published in:
- Computational Management Science, 2010, v. 7, n. 3, p. 225, doi. 10.1007/s10287-009-0114-7
- By:
- Publication type:
- Article
5
A metaheuristic for the min–max windy rural postman problem with K vehicles.
- Published in:
- Computational Management Science, 2010, v. 7, n. 3, p. 269, doi. 10.1007/s10287-009-0119-2
- By:
- Publication type:
- Article
6
An approximate solution approach for a scenario-based capital budgeting model.
- Published in:
- Computational Management Science, 2010, v. 7, n. 3, p. 337, doi. 10.1007/s10287-009-0117-4
- By:
- Publication type:
- Article