Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling

DOI10.1287/opre.2019.1864zbMath1444.90032OpenAlexW2953843918WikidataQ127576367 ScholiaQ127576367MaRDI QIDQ5129179

Bijan Taslimi, Ece Içyüz-Ay, Danial Davarnia, Jean-Philippe P. Richard

Publication date: 26 October 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/cfd50becf70fa9c6812c83f4dd1235468775d384

zbMATH Keywords

cutting planesnetwork optimizationmixed integer programsunit trains

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items (1)

A novel mixed integer programming model for freight train travel time estimation

Cites Work

• Unnamed Item
• Optimising a coal rail network under capacity constraints
• The \(k\)-splittable flow problem
• On the choice of explicit stabilizing terms in column generation
• Valid inequalities for mixed 0-1 programs
• On the single-source unsplittable flow problem
• Minimum cost capacity installation for multicommodity network flows
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• A branch-and-cut algorithm for capacitated network design problems
• On capacitated network design cut-set polyhedra
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A Survey of Optimization Models for Train Routing and Scheduling
• Mixed Integer Linear Programming Formulation Techniques
• On cut-based inequalities for capacitated network design polyhedra
• A Branch-First, Cut-Second Approach for Locomotive Assignment
• Valid Linear Inequalities for Fixed Charge Problems
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Disjunctive Programming
• Lectures on Polytopes
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• Network Design Using Cut Inequalities

This page was built for publication: Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling