Works matching IS 02545330 AND DT 1985 AND VI 4 AND IP 1-4
Results: 14
ONE-PARAMETRIC BOTTLENECK TRANSPORTATION PROBLEMS.
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 343, doi. 10.1007/BF02022047
- By:
- Publication type:
- Article
A PROBLEM EXPANDING PARAMETRIC PROGRAMMING METHOD FOR SOLVING THE JOB SHOP SCHEDULING PROBLEM.
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 327, doi. 10.1007/BF02022046
- By:
- Publication type:
- Article
A METHOD FOR MAXIMIZING THE RELIABILITY COEFFICIENT OF A COMMUNICATIONS NETWORK.
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 307, doi. 10.1007/BF02022045
- By:
- Publication type:
- Article
LOCAL SEARCH IN ROUTING PROBLEMS WITH TIME WINDOWS.
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 285, doi. 10.1007/BF02022044
- By:
- Publication type:
- Article
AN EFFICIENT ALORITHM FOR THE GENERAL MULTIPLE-CHOICE KNAPSACK PROBLEM (GMKP).
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 253, doi. 10.1007/BF02022043
- By:
- Publication type:
- Article
SCHEDULING OF PROJECT NETWORKS.
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 227, doi. 10.1007/BF02022042
- By:
- Publication type:
- Article
ALGORITHMIC ASPECTS OF THE SUBSTITUTION DECOMPOSITION IN OPTIMIZATION OVER RELATIONS, SET SYSTEMS AND BOOLEAN FUNCTIONS.
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 195
- By:
- Publication type:
- Article
LP-BASED COMBINATORIAL PROBLEM SOLVING.
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 145, doi. 10.1007/BF02022040
- By:
- Publication type:
- Article
K BEST SOLUTIONS TO COMBINATORIAL OPTIMIZATION PROBLEMS.
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 123, doi. 10.1007/BF02022039
- By:
- Publication type:
- Article
AN OPTIMAL MINIMAX ALGORITHM.
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 103, doi. 10.1007/BF02022038
- By:
- Publication type:
- Article
THE SHORTEST AUGMENTING PATH METHOD FOR SOLVING ASSIGNMENT PROBLEMS -- MOTIVATION AND COMPUTATIONAL EXPERIENCE.
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 57, doi. 10.1007/BF02022037
- By:
- Publication type:
- Article
SENSITIVITY ANALYSIS FOR THE MATCHING PROBLEM AND ITS USE IN SOLVING MATCHING PROBLEMS WITH A SINGLE SIDE CONSTRAINT.
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 25, doi. 10.1007/BF02022036
- By:
- Publication type:
- Article
A COMPUTATIONAL COMPARISON OF ALGORITHMS FOR THE INVENTORY ROUTING PROBLEM.
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 3, doi. 10.1007/BF02022035
- By:
- Publication type:
- Article
Special Volume on 'Algorithms and Software for Optimization'
- Published in:
- Annals of Operations Research, 1985, v. 4, n. 1-4, p. 1
- By:
- Publication type:
- Article