Reformulated acyclic partitioning for rail-rail containers transshipment
From MaRDI portal
Publication:1735174
DOI10.1016/j.ejor.2019.02.022zbMath1430.90419OpenAlexW2912321232MaRDI QIDQ1735174
Alfredo Marín, Antonio M. Rodríguez-Chía, Maria Albareda-Sambola
Publication date: 28 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/130747
Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- A branch-and-bound algorithm for the acyclic partitioning problem
- Facets of the clique partitioning polytope
- A cutting plane algorithm for a clustering problem
- Cliques and clustering: A combinatorial approach
- The node capacitated graph partitioning problem: A computational study
- Min-cut clustering
- Clustering data that are graph connected
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- Towards a general theory of classifications
- Redundant constraints in the standard formulation for the clique partitioning problem
- New bounds and constraint propagation techniques for the clique partitioning problem
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles
- Recent directions in netlist partitioning: a survey
- Solving Graph Partitioning Problems Arising in Tagless Cache Management
- Integer Programming Formulation of Traveling Salesman Problems
- Multiple-way network partitioning
- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles
- An Efficient Heuristic Procedure for Partitioning Graphs
- Fast Clustering Algorithms
- The clique partitioning problem: Facets and patching facets
- Efficient Algorithm for the Partitioning of Trees
This page was built for publication: Reformulated acyclic partitioning for rail-rail containers transshipment
