scientific article; zbMATH DE number 6741964

From MaRDI portal

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

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

Publication:5271454

Jump to:navigation, search

zbMath1379.90049MaRDI QIDQ5271454

Christian Prins

Publication date: 11 July 2017

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

metaheuristics constructive heuristics arc routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (6)

An efficiency-based path-scanning heuristic for the capacitated arc routing problem ⋮ Hybrid genetic algorithm for the open capacitated arc routing problem ⋮ The commodity-split multi-compartment capacitated arc routing problem ⋮ Fast upper and lower bounds for a large‐scale real‐world arc routing problem ⋮ Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics

This page was built for publication:

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