Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Combinatorial Optimization

New Frontiers in Theory and Practice

  • Conference proceedings
  • © 1992

Overview

Editors:
  1. Mustafa Akgül

    1. Department of Industrial Engineering, Bilkent University, Ankara, Turkey

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Horst W. Hamacher

    1. Fachbereich Mathematik, Universität Kaiserslautern, Kaiserslautern, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Süleyman Tüfekçi

    1. Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: NATO ASI Subseries F: (NATO ASI F, volume 82)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (38 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Variable Decomposition, Constraint Decomposition and Cross Decomposition in General Mathematical Programming

    • Olaf E. Flippo, Alexander H. G. Rinnooy Kan
    Pages 1-18

  3. Surrogate Constraint Methods for Linear Inequalities

    • Kai Yang, Katta G. Murty
    Pages 19-38

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

    • U. Derigs, W. Meier
    Pages 39-62

  5. A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times

    • G. L. Nemhauser, M. W. P. Savelsbergh
    Pages 63-83

  6. The Linear Assignment Problem

    • Mustafa Akgül
    Pages 85-122

  7. Cost Allocation In The Oil Industry: An Example

    • Kurt O. Jørnsten
    Pages 123-132

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

    • E. L. Lawler
    Pages 133-159

  9. Dynamic Basis Partitioning for Network Flows with Side Constraints

    • Wonjoon Choi, Süleyman Tüfekçi
    Pages 161-185

  10. Combinatorial Optimization Models Motivated by Robotic Assembly Problems

    • Horst W. Hamacher
    Pages 187-198

  11. Job Shop Scheduling

    • J. K. Lenstra
    Pages 199-207

  12. On the Construction of the Set of K-best Matchings and Their Use in Solving Constrained Matching Problems

    • U. Derigs, A. Metz
    Pages 209-223

  13. Solving Large Scale Multicommodity Networks Using Linear—Quadratic Penalty Functions

    • Mustafa Ç Pinar, Stavros A. Zenios
    Pages 225-230

  14. An Analysis of the Minimal Spanning Tree Structure

    • Elzbieta Trybus
    Pages 231-234

  15. Genetic Algorithms: A New Approach to the Timetable Problem

    • Alberto Colorni, Marco Dorigo, Vittorio Maniezzo
    Pages 235-239

  16. A New Approximation Technique for Hypergraph Partitioning Problem

    • Scott W. Hadley
    Pages 241-244

  17. Optimal Location of Concentrators in a Centralized Teleprocessing Network

    • M. G. de Oliveira
    Pages 245-248

  18. A Column Generation Algorithm for the Vehicle Routing Problem with Time Windows

    • Martin Desrochers, Jacques Desrosiers, Marius Solomon
    Pages 249-252

  19. The Linear Complementary Problem, Sufficient Matrices and the Criss-Cross Method

    • D. den Hertog, C. Roos, T. Terlaky
    Pages 253-257

  20. A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints

    • George L. Nemhauser, Gabriele Sigismondi, Pamela Vance
    Pages 259-261
Back to top

Keywords

About this book

There have been significant developments in the theory and practice of combinatorial optimization in the last 15 years. This progress has been evidenced by a continuously increasing number of international and local conferences, books and papers in this area. This book is also another contribution to this burgeoning area of operations research and optimization. This volume contains the contributions of the participants of the recent NATO Ad­ vanced Study Institute, New Frontiers in the Theory and Practice of Combinatorial Op­ timization, which was held at the campus of Bilkent University, in Ankara, Turkey, July 16-29, 1990. In this conference, we brought many prominent researchers and young and promising scientists together to discuss current and future trends in the theory and prac­ tice of combinatorial optimization. The Bilkent campus was an excellent environment for such an undertaking. Being outside of Ankara, the capital of Turkey, Bilkent University gave the participants a great opportunity for exchanging ideas and discussing new theories and applications without much distraction. One of the primary goals of NATO ASIs is to bring together a group of scientists and research scientists primarily from the NATO countries for the dissemination of ad­ vanced scientific knowledge and the promotion of international contacts among scientists. We believe that we accomplished this mission very successfully by bringing together 15 prominent lecturers and 45 promising young scientists from 12 countries, in a university environment for 14 days of intense lectures, presentations and discussions.

Editors and Affiliations

  • Department of Industrial Engineering, Bilkent University, Ankara, Turkey

    Mustafa Akgül

  • Fachbereich Mathematik, Universität Kaiserslautern, Kaiserslautern, Germany

    Horst W. Hamacher

  • Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA

    Süleyman Tüfekçi

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation