This publication is presented to you through Paradigm Publishing Services

Princeton University Press

Home Princeton University Press Hamiltonian Cycles, Quadratic Programming, and Ranking of Extreme Points
Chapter
Licensed
Unlicensed Requires Authentication

Hamiltonian Cycles, Quadratic Programming, and Ranking of Extreme Points

  • Ming Chen and Jerzy A. Filar

Chapters in this book

  1. Frontmatter i
  2. CONTENTS v
  3. PREFACE ix
  4. On approximation algorithms for concave quadratic programming 3
  5. A New Complexity Result on Minimization of a Quadratic Function with a Sphere Constraint 19
  6. Hamiltonian Cycles, Quadratic Programming, and Ranking of Extreme Points 32
  7. Performance of Local Search In Minimum Concave-Cost Network Flow Problems 50
  8. SOLUTION OF THE CONCAVE LINEAR COMPLEMENTARITY PROBLEM 76
  9. Global Solvability of Generalized Linear Complementarity Problems and a Related Class of Polynomial Complementarity Problems 102
  10. A Continuous Approach to Compute Upper Bounds in Quadratic Maximization Problems With Integer Constraints 125
  11. A Class of Global Optimization Problems Solvable by Sequential Unconstrained Convex Minimization 141
  12. A New Cutting Plane Algorithm for a Class of Reverse Convex 0-1 Integer Programs 152
  13. Global Optimization of Problems with Polynomial Functions in One Variable 165
  14. One Dimensional Global Optimization Using Linear Lower Bounds 200
  15. Optimizing the Sum of Linear Fractional Functions 221
  16. Minimizing and Maximizing the Product of Linear Fractional Functions 259
  17. Numerical Methods for Global Optimization 274
  18. Integral Global Optimization of Constrained Problems in Functional Spaces with Discontinuous Penalty Functions 298
  19. Rigorous Methods for Global Optimization 321
  20. Global Optimization of Composite Laminates Using Improving Hit and Run 343
  21. Stochastic Minimization of Lipschitz Functions 369
  22. Topographical Global Optimization 384
  23. Lipschitzian Global Optimization: Some Prospective Applications 399
  24. Packet Annealing: A Deterministic Method for Global Minimization. Application to Molecular Conformation 433
  25. Mixed-Integer Linear Programming Reformulations for Some Nonlinear Discrete Design Optimization Problems 478
  26. Mixed-Integer Nonlinear Programming on Generalized Networks 513
  27. Global Minima in Root Finding 543
  28. HOMOTOPY-CONTINUATION ALGORITHM FOR GLOBAL OPTIMIZATION 561
  29. SPACE-COVERING APPROACH AND MODIFIED FRANK-WOLFE ALGORITHM FOR OPTIMAL NUCLEAR REACTOR RELOAD DESIGN 593
  30. A GLOBAL OPTIMIZATION APPROACH TO SOFTWARE TESTING 616
Recent Advances in Global Optimization
This chapter is in the book Recent Advances in Global Optimization
Downloaded on 18.3.2026 from https://www.degruyterbrill.com/document/doi/10.1515/9781400862528.32/html
Scroll to top button