Data correcting approaches in combinatorial optimization.

DOI10.1007/978-1-4614-5286-7MaRDI QIDQ2910841zbMATH OpenOpenAlexFDO

Authors Boris Goldengorin, Panos M. Pardalos

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

approximationasymmetric traveling salesman problembranch and bounddata correctionmaximization of submodular functionspolynomially solvable special casesquadratic cost partitionsimple plant location problem

Mathematics Subject Classification ID

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

Recommendations

• Solving the simple plant location problem using a data correcting approach
• The Data-Correcting Algorithm for the Minimization of Supermodular Functions
• Introduction to combinatorial optimization
• A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
• scientific article; zbMATH DE number 863497

Cited in

(5)

• Solving the simple plant location problem using a data correcting approach
• Uncertainty-safe large scale support vector machines
• scientific article; zbMATH DE number 3885230 (Why is no real title available?)
• Pareto-optimal front of cell formation problem in group technology
• The Data-Correcting Algorithm for the Minimization of Supermodular Functions

Describes a project that uses

Uses Software

• SFO

This page was built for publication: Data correcting approaches in combinatorial optimization.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910841)