Column-generation based bounds for the homogeneous areas problem

DOI10.1016/j.ejor.2013.12.030zbMath1317.90304OpenAlexW2012456746MaRDI QIDQ2356280

Marco Trubian, Fabio Colombo, Roberto Cordone

Publication date: 29 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.12.030

zbMATH Keywords

column generationtabu searchgraph partitioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Primal Heuristics for Branch and Price: The Assets of Diving Methods ⋮ Simultaneous node and link districting in transportation networks: model, algorithms and railway application

Uses Software

• KaFFPa
• Tabu search

Cites Work

• Unnamed Item
• A set-covering based heuristic algorithm for the periodic vehicle routing problem
• Experimental algorithms. 11th international symposium, SEA 2012, Bordeaux, France, June 7--9, 2012. Proceedings
• Sparsest cuts and bottlenecks in graphs
• The node capacitated graph partitioning problem: A computational study
• Future paths for integer programming and links to artificial intelligence
• Linear and quadratic programming approaches for the general graph partitioning problem
• Approximation algorithms for minimum \(K\)-cut
• Employee workload balancing by graph partitioning
• Column Generation based Primal Heuristics
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
• Engineering Multilevel Graph Partitioning Algorithms
• A Primer in Column Generation
• Lower Bounds for the Partitioning of Graphs
• Handbook of metaheuristics

This page was built for publication: Column-generation based bounds for the homogeneous areas problem