Emergency path restoration problems (Q435733)

From MaRDI portal

Revision as of 10:41, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Emergency path restoration problems	scientific article

Statements

scholarly article

0 references

Emergency path restoration problems (English)

0 references

0 references

Discrete Optimization

0 references

publication date

12 July 2012

0 references

zbMATH Keywords

combinatorial optimization

0 references

scheduling

0 references

polynomial algorithm

0 references

network construction

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disopt.2012.01.001

0 references

The complexity of the travelling repairman problem

0 references

Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path

0 references

Profit-based latency problems on the line

0 references

A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times

0 references

Computer-Aided Complexity Classification of Dial-a-Ride Problems

0 references

Routing and Scheduling on a Shoreline with Release Times

0 references

Special cases of traveling salesman and repairman problems with time windows

0 references

Vehicle routing problems on a line-shaped network with release time constraints

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.disopt.2012.01.001

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:435733

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q435733&oldid=35288979"