An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem (Q1761166): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2011.12.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999260692 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58921233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3159349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact methods based on node-routing formulations for undirected arc-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated arc routing problem: Valid inequalities and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the mixed capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated Arc Routing Problem: Lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided local search heuristic for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic tabu search algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part II: The Rural Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive memetic algorithms for arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for a bi-objective capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in pricing routines for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving capacitated arc routing problems using a transformation to the CVRP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Mom Matrix To Sparse Matrices for Wire Antennas and Wire Scattering By Mei Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bound for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decade of Capacitated Arc Routing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:46, 5 July 2024

scientific article
Language Label Description Also known as
English
An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
scientific article

    Statements

    An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    multi-objective combinatorial optimization
    0 references
    arc routing problems
    0 references
    hybrid heuristic algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references