Branch-and-cut for a 2-commodity flow relocation model with time constraints

DOI10.1007/978-3-031-18530-4_2zbMath1528.90054MaRDI QIDQ6166886

Alain Quilliot, José Luis Figueroa González, Mourad Baïou, Hélène Toussaint, Annegret K. Wagler

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

network flowsbranch-and-cutrelocation problemtime expanded networks

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
• A survey of dynamic network flows
• Inventory rebalancing and vehicle routing in bike sharing systems
• Bike sharing systems: solving the static rebalancing problem
• Balancing the stations of a self service “bike hire” system
• Estimation and Prediction of Time-Dependent Origin-Destination Flows with a Stochastic Mapping to Path Flows and Link Flows
• Fleet management for autonomous vehicles using flows in time-expanded networks
• Fleet management for autonomous vehicles using flows in time-expanded networks

This page was built for publication: Branch-and-cut for a 2-commodity flow relocation model with time constraints