Combinatorial Optimization
Latest Publications

TOTAL DOCUMENTS

38

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642774911, 9783642774898

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On Preference Orders for Sequencing Problems Or, What Hath Smith Wrought?

Combinatorial Optimization ◽

10.1007/978-3-642-77489-8_7 ◽

1992 ◽

pp. 133-159

Author(s):

E. L. Lawler

Keyword(s):

Sequencing Problems ◽

Preference Orders

Download Full-text

Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs

Combinatorial Optimization ◽

10.1007/978-3-642-77489-8_26 ◽

1992 ◽

pp. 287-289

Author(s):

H. G. Kahlbacher ◽

T. C. E. Cheng

Keyword(s):

Machine Scheduling ◽

Parallel Machine Scheduling ◽

Parallel Machine ◽

Number Of Tardy Jobs ◽

Tardy Jobs ◽

Minimize Costs

Download Full-text

An Analogue of Hoffman’s Circulation Conditions for Max-Balanced Flows

Combinatorial Optimization ◽

10.1007/978-3-642-77489-8_24 ◽

1992 ◽

pp. 279-281

Author(s):

Mark Hartmann ◽

Michael H. Schneider

Download Full-text

Surrogate Constraint Methods for Linear Inequalities

Combinatorial Optimization ◽

10.1007/978-3-642-77489-8_2 ◽

1992 ◽

pp. 19-38

Author(s):

Kai Yang ◽

Katta G. Murty

Keyword(s):

Linear Inequalities ◽

Surrogate Constraint

Download Full-text

Genetic Algorithms: A New Approach to the Timetable Problem

Combinatorial Optimization ◽

10.1007/978-3-642-77489-8_14 ◽

1992 ◽

pp. 235-239 ◽

Cited By ~ 12

Author(s):

Alberto Colorni ◽

Marco Dorigo ◽

Vittorio Maniezzo

Keyword(s):

Genetic Algorithms ◽

New Approach ◽

Timetable Problem

Download Full-text

Dynamic Basis Partitioning for Network Flows with Side Constraints

Combinatorial Optimization ◽

10.1007/978-3-642-77489-8_8 ◽

1992 ◽

pp. 161-185

Author(s):

Wonjoon Choi ◽

Süleyman Tüfekçi

Keyword(s):

Network Flows ◽

Side Constraints

Download Full-text

New Bounds for the Asymmetric Traveling Salesman Problem

Combinatorial Optimization ◽

10.1007/978-3-642-77489-8_37 ◽

1992 ◽

pp. 323-324

Author(s):

A. I. Barros ◽

P. Bárcia

Keyword(s):

Traveling Salesman Problem ◽

Traveling Salesman ◽

Asymmetric Traveling Salesman Problem

Download Full-text

A Polynomially Bounded Dual Simplex Algorithm for Capacitated Minimum Cost Flow Problem

Combinatorial Optimization ◽

10.1007/978-3-642-77489-8_32 ◽

1992 ◽

pp. 307-308

Author(s):

Canan A. Sepil ◽

Ayşegül Altaban

Keyword(s):

Flow Problem ◽

Minimum Cost ◽

Simplex Algorithm ◽

Minimum Cost Flow ◽

Dual Simplex ◽

Minimum Cost Flow Problem ◽

Cost Flow ◽

Dual Simplex Algorithm

Download Full-text

An Evaluation of Algorithmic Refinements and Proper Data Structures for the Preflow-Push Approach for Maximum Flow

Combinatorial Optimization ◽

10.1007/978-3-642-77489-8_3 ◽

1992 ◽

pp. 39-62 ◽

Cited By ~ 4

Author(s):

U. Derigs ◽

W. Meier

Keyword(s):

Data Structures ◽

Maximum Flow

Download Full-text

Optimal Location of Concentrators in a Centralized Teleprocessing Network

Combinatorial Optimization ◽

10.1007/978-3-642-77489-8_16 ◽

1992 ◽

pp. 245-248

Author(s):

M. G. de Oliveira

Keyword(s):

Optimal Location

Download Full-text