Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

From MaRDI portal

Revision as of 22:23, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5313022

Jump to:navigation, search

DOI10.1007/B99805zbMath1105.90358OpenAlexW4301133941MaRDI QIDQ5313022

Alantha Newman

Publication date: 25 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99805

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

Semidefinite relaxations of ordering problems ⋮ A semidefinite optimization approach to the target visitation problem ⋮ Revised GRASP with path-relinking for the linear ordering problem ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ New semidefinite programming relaxations for the linear ordering and the traveling salesman problem

This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5313022&oldid=19989293"