Generalized network design problems. Modeling and optimization.

DOI10.1515/9783110267686MaRDI QIDQ455036zbMATH OpenOpenAlexFDO

Authors Petrica Pop

Publication date 4 October 2012

Published in De Gruyter Series in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/9783110267686

zbMATH Keywords

computational complexityheuristicsapproximation algorithmnetwork designvehicle routingtraveling salesmanrailway traveling salesmanspanning tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Approximation algorithms (68W25)

Recommendations

• Generalized network design polyhedra
• New models of the generalized minimum spanning tree problem
• Generalized network design problems.
• On the generalized minimum spanning tree problem
• Generalized Steiner problems and other variants

Cited in

(26)

• Network optimization and problems with coupling variables
• A comprehensive survey on the generalized traveling salesman problem
• The multicolored graph realization problem
• scientific article; zbMATH DE number 5831322 (Why is no real title available?)
• Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization
• A tutorial on the balanced minimum evolution problem
• Modeling and solving the two-level generalized median tour problem
• Generalized network design polyhedra
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs
• A problem in the optimal design of networks under transverse loading
• Generalized Steiner problems and other variants
• On the complexity of the selective graph coloring problem in some special classes of graphs
• An improved hybrid ant-local search algorithm for the partition graph coloring problem
• A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
• The generalized fixed-charge network design problem
• Generalized network design problems.
• Network-related problems in optimal experimental design and second order cone programming
• A two-level solution approach for solving the generalized minimum spanning tree problem
• Enhanced savings calculation and its applications for solving capacitated vehicle routing problem
• A branch-price-and-cut algorithm for the minimum evolution problem
• scientific article; zbMATH DE number 5831321 (Why is no real title available?)
• Wireless network design. Optimization models and solution procedures.
• New models of the generalized fixed-charge network design problem
• General network design: a unified view of combined location and network design problems
• Shortest Paths in Graphs of Convex Sets

This page was built for publication: Generalized network design problems. Modeling and optimization.

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