Data Correcting Approaches in Combinatorial Optimization

DOI10.1007/978-1-4614-5286-7zbMath1304.90171OpenAlexW1512594989MaRDI QIDQ2910841

Panos M. Pardalos, Boris I. Goldengorin

Publication date: 12 September 2012

Published in: SpringerBriefs in Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-5286-7

zbMATH Keywords

approximationbranch and boundasymmetric traveling salesman problemsimple plant location problempolynomially solvable special casesquadratic cost partitiondata correctionmaximization of submodular functions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Uncertainty-safe large scale support vector machines ⋮ Pareto-optimal front of cell formation problem in group technology

Uses Software

• SFO