Operations Research Proceedings 1999

Selected Papers of the Symposium on Operations Research (SOR ’99), Magdeburg, September 1–3, 1999

ISBN: 978-3-540-67094-0 (Print) 978-3-642-58300-1 (Online)

Table of contents (87 chapters)

previous Page of 5
  1. Front Matter

    Pages I-XIX

  2. No Access

    Book Chapter

    Pages 1-6

    Optimal Design of Discrete Engineering Structures Resisting Effects of Material Degradation

  3. No Access

    Book Chapter

    Pages 7-12

    A Bundle Trust Region Algorithm for Bilinear Bilevel Programming

  4. No Access

    Book Chapter

    Pages 13-18

    Convergence Analysis for General Penalty Path-Following Newton Iterations

  5. No Access

    Book Chapter

    Pages 19-22

    A Regularization Approach for Variational Inequalities with Pseudo-Monotone Operators

  6. No Access

    Book Chapter

    Pages 23-29

    A Curvilinear Pseudo-Newton Algorithm for Nonlinear Programming

  7. No Access

    Book Chapter

    Pages 30-35

    Pathfollowing and Jumps in Bilevel Programming

  8. No Access

    Book Chapter

    Pages 36-40

    Multiobjective Duality for Convex-Linear Problems

  9. No Access

    Book Chapter

    Pages 41-46

    Maximum Representation of Some Convex Marginal Functions Without Constant Rank Regularity

  10. No Access

    Book Chapter

    Pages 47-51

    Polyatomic Discrete Tomography — Polyhedral Aspects

  11. No Access

    Book Chapter

    Pages 52-57

    Orienting Dart-free Clique-Helly Chordal Graphs

  12. No Access

    Book Chapter

    Pages 58-62

    On Some Approximation Algorithms for Dense Vertex Cover Problem

  13. No Access

    Book Chapter

    Pages 63-68

    A Probabilistic Analysis of an Approximation Algorithm for the Minimum Weight Spanning Tree Problem with Bounded from Below Diameter

  14. No Access

    Book Chapter

    Pages 69-74

    Approximating Stable Sets Using the ϑ-function and Cutting Planes

  15. No Access

    Book Chapter

    Pages 75-80

    Optimizing Generalized Profiles for Enhanced Discrimination of Biomolecular Sequences

  16. No Access

    Book Chapter

    Pages 81-85

    Polyhedral Aspects of the Consecutive Ones Problem

  17. No Access

    Book Chapter

    Pages 86-91

    Solving One-Dimensional Cutting Stock Problems Exactly with a Cutting Plane Algorithm

  18. No Access

    Book Chapter

    Pages 92-94

    Graph Drawing: the Aesthetics-Complexity Trade-Off

  19. No Access

    Book Chapter

    Pages 95-101

    The Smallest Hard-to-Color Graphs for Sequential Coloring Algorithms

  20. No Access

    Book Chapter

    Pages 102-110

    Optimal Control in Economical and Technical Problems

  21. No Access

    Book Chapter

    Pages 111-116

    Über Probleme der optimalen Steuerung mit einer Quasivariationsungleichung

previous Page of 5