Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The stop number minimization problem: complexity and polyhedral analysis

From MaRDI portal
Publication:1661860
Jump to:navigation, search

DOI10.1007/978-3-319-96151-4_6zbMath1404.90108OpenAlexW2884776797MaRDI QIDQ1661860

Mourad Baïou, Rafael Colares, Hervé L. M. Kerivin

Publication date: 17 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96151-4_6


zbMATH Keywords

complexitybranch-and-cutautonomous vehicles


Mathematics Subject Classification ID

Combinatorial optimization (90C27)


Related Items (1)

Pickup and delivery problems with autonomous vehicles on rings







This page was built for publication: The stop number minimization problem: complexity and polyhedral analysis

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1661860&oldid=13977590"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 04:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki