Operations Research Proceedings 1998

Selected Papers of the International Conference on Operations Research Zurich, August 31 – September 3, 1998

ISBN: 978-3-540-65381-3 (Print) 978-3-642-58409-1 (Online)

Table of contents (56 chapters)

previous Page of 3
  1. Front Matter

    Pages I-XII

  2. Opening Session Plenary Lectures

    1. Front Matter

      Pages 1-1

    2. No Access

      Book Chapter

      Pages 3-20

      Challenges for Operations Research as a Scientific Discipline at the Beginning of the 21st Century

    3. No Access

      Book Chapter

      Pages 21-37

      Combinatorial Online Optimization

  3. Mathematical Optimization — Continuous

    1. Front Matter

      Pages 39-39

    2. No Access

      Book Chapter

      Pages 41-52

      Oligopolies as Dynamic Games: A Computational Economics Perspective

    3. No Access

      Book Chapter

      Pages 53-62

      Application of Topological Degree Theory to Semi-Definite Complementarity Problem

    4. No Access

      Book Chapter

      Pages 63-72

      On the First-Order Estimation of Multipliers from Kuhn-Tucker Systems in Multiplier Methods Using Variable Reduction

    5. No Access

      Book Chapter

      Pages 73-82

      Properties of Some Convex Marginal Functions Without Constant Rank Regularity

    6. No Access

      Book Chapter

      Pages 83-92

      A Numerical Approach to Optimization w.r.t. Variable-Dependent Constraint-Indices

    7. No Access

      Book Chapter

      Pages 93-102

      Minimization of Maximal Torque of a Flywheel Robot

    8. No Access

      Book Chapter

      Pages 103-112

      A Phase-1-Algorithm for Interior-Point-Methods: Worst-Case and Average-Case Behaviour

    9. No Access

      Book Chapter

      Pages 113-122

      Towards a Unified Framework for Randomized Pivoting Algorithms in Linear Programming

  4. Mathematical Optimization — Discrete

    1. Front Matter

      Pages 123-123

    2. No Access

      Book Chapter

      Pages 125-134

      The Constrained Crossing Minimization Problem A First Approach

    3. No Access

      Book Chapter

      Pages 135-141

      Sensitivity Analysis of the Bipartite Weighted Matching Problem

    4. No Access

      Book Chapter

      Pages 142-151

      Partitioning Cliques of Claw-Free Strongly Chordal Graphs

    5. No Access

      Book Chapter

      Pages 152-157

      Extreme Rays of the Cones of Subadditive Functions

    6. No Access

      Book Chapter

      Pages 158-167

      Flow Improvement and Network Flows with Fixed Costs

    7. No Access

      Book Chapter

      Pages 168-174

      Comparison of an Exact Branch-and-Bound and an Approximative Evolutionary Algorithm for the Probabilistic Traveling Salesman Problem

    8. No Access

      Book Chapter

      Pages 175-181

      A Genetic Algorithm with a Non-Binary Representation for the Set Covering Problem

    9. No Access

      Book Chapter

      Pages 182-191

      A Dynamical System Based Heuristic for a Class of Constrained Semi-Assignment Problems

    10. No Access

      Book Chapter

      Pages 192-199

      On the Mathematical Treatment of Pileproblems

    11. No Access

      Book Chapter

      Pages 200-209

      Mean Value Cross Decomposition Based Branch-and-Bound for Mixed Integer Programming Problems

previous Page of 3