Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags.
- Published in:
- Computing, 1999, v. 63, n. 4, p. 299, doi. 10.1007/s006070050036
- By:
- Publication type:
- Article
Works matching IS 0010485X AND DT 1999 AND VI 63 AND IP 4
Results: 8
1
2
Volume Maximization and Orthoconvex Approximation of Orthogons.
- Published in:
- Computing, 1999, v. 63, n. 4, p. 317, doi. 10.1007/s006070050037
- By:
- Publication type:
- Article
3
Semidefinite Programs and Association Schemes.
- Published in:
- Computing, 1999, v. 63, n. 4, p. 331, doi. 10.1007/s006070050038
- By:
- Publication type:
- Article
4
Minimal Expansions in Redundant Number Systems and Shortest Paths in Graphs.
- Published in:
- Computing, 1999, v. 63, n. 4, p. 341, doi. 10.1007/s006070050039
- By:
- Publication type:
- Article
5
A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on Linearization.
- Published in:
- Computing, 1999, v. 63, n. 4, p. 351, doi. 10.1007/s006070050040
- By:
- Publication type:
- Article
6
New Heuristics for the Multidimensional Vote Assignment Problem.
- Published in:
- Computing, 1999, v. 63, n. 4, p. 405, doi. 10.1007/s006070050041
- By:
- Publication type:
- Article
7
Dynamic Programming Revisited: Improving Knapsack Algorithms.
- Published in:
- Computing, 1999, v. 63, n. 4, p. 419, doi. 10.1007/s006070050042
- By:
- Publication type:
- Article
8
Editorial.
- Published in:
- 1999
- By:
- Publication type:
- Editorial