Delay-constrained routing problems: accurate scheduling models and admission control

DOI10.1016/J.COR.2016.12.009zbMath1391.90264OpenAlexW2344296803WikidataQ56523997 ScholiaQ56523997MaRDI QIDQ1652220

Antonio Frangioni, Giovanni Stea, Laura Galli

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11568/824772

zbMATH Keywords

admission controlscheduling algorithmsrouting problemsperspective reformulationsecond-order cone programsmaximum delay constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Quadratic programming (90C20) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

QPLIB: a library of quadratic programming instances

Cites Work

• Delay-constrained shortest paths: approximation algorithms and second-order cone models
• Perspective cuts for a class of convex 0-1 mixed integer programs
• Projected Perspective Reformulations with Applications in Design Problems
• Network calculus. A theory of deterministic queueing systems for the Internet

This page was built for publication: Delay-constrained routing problems: accurate scheduling models and admission control