The machine learning and traveling repairman problem

DOI10.1007/978-3-642-24873-3_20MaRDI QIDQ3095308zbMATHOpenAlexFDO

Authors Theja Tulabandhula, Cynthia Rudin, Patrick Jaillet

Publication date 28 October 2011

Published in Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/73935

zbMATH Keywords

machine learninguncertaintyinteger programminggeneralization boundtraveling repairmanconstrained linear function classes

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• On combining machine learning with decision making
• Routing under uncertainty: the \textit{a priori} traveling repairman problem
• Approximation algorithms for the a priori traveling repairman
• The A priori traveling repairman problem
• The complexity of the travelling repairman problem

Cited in

(4)

• Network-based approximate linear programming for discrete optimization
• Policies for the dynamic traveling maintainer problem with alerts
• The risk-averse traveling repairman problem with profits
• On combining machine learning with decision making

This page was built for publication: The machine learning and traveling repairman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095308)