Reformulated acyclic partitioning for rail-rail containers transshipment
type: Item
instance of: scholarly article
title: Reformulated acyclic partitioning for rail-rail containers transshipment
zbMATH Open document ID: 1430.90419
author: Maria Albareda-Sambola
author: Alfredo Marín
author: Antonio M. Rodríguez-Chía
published in: European Journal of Operational Research
publication date: 2019-03-28T00:00:00Z
full work available at URL: http://hdl.handle.net/2117/130747
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 7043894
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: rail-rail transshipment
zbMATH Keywords: integer programming
zbMATH Keywords: graph partitioning
MaRDI profile type: Publication
OpenAlex ID: W2912321232
cites work: Recent directions in netlist partitioning: a survey
cites work: Solving Graph Partitioning Problems Arising in Tagless Cache Management
cites work: Clustering data that are graph connected
cites work: Fast Clustering Algorithms
cites work: Formulations and valid inequalities of the node capacitated graph partitioning problem
cites work: The node capacitated graph partitioning problem: A computational study
cites work: Q4198056
cites work: A cutting plane algorithm for a clustering problem
cites work: Facets of the clique partitioning polytope
cites work: The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
cites work: New bounds and constraint propagation techniques for the clique partitioning problem
cites work: Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
cites work: Min-cut clustering
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Efficient Algorithm for the Partitioning of Trees
cites work: Cliques and clustering: A combinatorial approach
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Redundant constraints in the standard formulation for the clique partitioning problem
cites work: Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles
cites work: Coloring graphs using two colors while avoiding monochromatic cycles
cites work: A branch-and-bound algorithm for the acyclic partitioning problem
cites work: The clique partitioning problem: Facets and patching facets
cites work: Towards a general theory of classifications
cites work: Multiple-way network partitioning
DOI: 10.1016/J.EJOR.2019.02.022
Recommended article: Q5702325
Recommended article: Optimised loading patterns for intermodal trains
Recommended article: On the Scheduling Problem of Cargo Transportation on a Railway Network Segment and Algorithms for Its Solution
Recommended article: Q3131402
Recommended article: Stowage plan based slot optimal allocation in rail-water container terminal
Recommended article: Analysis and Algorithms for the Transtainer Routing Problem in Container Port Operations
description: scientific article; zbMATH DE number 7043894