Column-generation based bounds for the homogeneous areas problem

DOI10.1016/J.EJOR.2013.12.030MaRDI QIDQ2356280zbMATH OpenOpenAlexFDO

Authors Fabio Colombo, Marco Trubian, 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 generationgraph partitioningtabu search

Mathematics Subject Classification ID

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

Recommendations

• Employee workload balancing by graph partitioning
• A complementary column generation approach for the graph equipartition problem
• scientific article; zbMATH DE number 1816804
• Complementary column generation and bounding approaches for set partitioning formulations
• Lower bounds to the graph partitioning problem through generalized linear programming and network flows

Cites work

• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
• A Primer in Column Generation
• A set-covering based heuristic algorithm for the periodic vehicle routing problem
• Approximation algorithms for minimum \(K\)-cut
• Column generation based primal heuristics
• Employee workload balancing by graph partitioning
• Engineering multilevel graph partitioning algorithms
• Experimental algorithms. 11th international symposium, SEA 2012, Bordeaux, France, June 7--9, 2012. Proceedings
• Future paths for integer programming and links to artificial intelligence
• Handbook of metaheuristics
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• Linear and quadratic programming approaches for the general graph partitioning problem
• Lower Bounds for the Partitioning of Graphs
• Sparsest cuts and bottlenecks in graphs
• The node capacitated graph partitioning problem: A computational study

Cited in

(3)

• Simultaneous node and link districting in transportation networks: model, algorithms and railway application
• A column generation approach to the discrete barycenter problem
• Primal Heuristics for Branch and Price: The Assets of Diving Methods

Describes a project that uses

Uses Software

• KaFFPa
• Tabu search

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

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