Minimum convex piecewise linear cost tension problem on quasi- k series-parallel graphs.
- Published in:
- 4OR (1619-4500), 2004, v. 2, n. 4, p. 275, doi. 10.1007/s10288-004-0049-3
- By:
- Publication type:
- Article
Works matching IS 16194500 AND DT 2004 AND VI 2 AND IP 4
Results: 8
1
2
A note on robust 0-1 optimization with uncertain cost coefficients.
- Published in:
- 4OR (1619-4500), 2004, v. 2, n. 4, p. 309, doi. 10.1007/s10288-004-0041-y
- By:
- Publication type:
- Article
3
Integrating local search techniques into mixed integer programming.
- Published in:
- 4OR (1619-4500), 2004, v. 2, n. 4, p. 321, doi. 10.1007/s10288-004-0042-x
- By:
- Publication type:
- Article
4
Non-classical preference models in combinatorial problems: Models and algorithms for graphs.
- Published in:
- 4OR (1619-4500), 2004, v. 2, n. 4, p. 325, doi. 10.1007/s10288-004-0045-7
- By:
- Publication type:
- Article
5
LP formulations of the shortest path tree problem.
- Published in:
- 4OR (1619-4500), 2004, v. 2, n. 4, p. 259, doi. 10.1007/s10288-004-0048-4
- By:
- Publication type:
- Article
6
Concordant outranking with multiple criteria of ordinal significance.
- Published in:
- 4OR (1619-4500), 2004, v. 2, n. 4, p. 293, doi. 10.1007/s10288-004-0053-7
- By:
- Publication type:
- Article
7
Knapsack problems: A book review.
- Published in:
- 4OR (1619-4500), 2004, v. 2, n. 4, p. 317, doi. 10.1007/s10288-004-0054-6
- By:
- Publication type:
- Article
8
Acknowledgement to referees.
- Published in:
- 4OR (1619-4500), 2004, v. 2, n. 4, p. 329, doi. 10.1007/s10288-004-0058-2
- Publication type:
- Article