A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem

From MaRDI portal

Revision as of 02:11, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:5412738

Jump to:navigation, search

DOI10.2298/YJOR1102187PzbMath1299.90285OpenAlexW2078772568MaRDI QIDQ5412738

Petrică C. Pop, Corina Pop Sitar

Publication date: 25 April 2014

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor1102187p

zbMATH Keywords

integer programming combinatorial optimization generalized combinatorial optimization problems efficient transformations

Mathematics Subject Classification ID

Integer programming (90C10) Network design and communication in computer systems (68M10) Combinatorial optimization (90C27)

Related Items (2)

A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem ⋮ Enhanced savings calculation and its applications for solving capacitated vehicle routing problem

This page was built for publication: A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem

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