Computational combinatorial optimization. Optimal of probably near-optimal solutions
From MaRDI portal
Publication:5952232
DOI10.1007/3-540-45586-8zbMath0977.00014OpenAlexW2476944423MaRDI QIDQ5952232
No author found.
Publication date: 9 January 2002
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45586-8
Combinatorial optimization (90C27) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (7)
Incremental Bundle Methods using Upper Models ⋮ Asynchronous level bundle methods ⋮ A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem ⋮ An algorithmic framework for convex mixed integer nonlinear programs ⋮ Symmetric ILP: Coloring and small integers ⋮ A branch-and-cut algorithm for the pallet loading problem ⋮ Exact dual bounds for some nonconvex minimax quadratic optimization problems
This page was built for publication: Computational combinatorial optimization. Optimal of probably near-optimal solutions
