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

scientific article

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

zbMath1277.90142MaRDI QIDQ2865872

Lara Turner

Publication date: 11 December 2013

Full work available at URL: http://journals.hil.unb.ca/index.php/AOR/article/view/18312

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

shortest path problemresource constrained shortest path problemuniversal objective functionstrongly polynomial-time algorithm


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)


Related Items (8)

Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks ⋮ A branch-and-cut algorithm for the balanced traveling salesman problem ⋮ Balanced Optimization with Vector Costs ⋮ Robust balanced optimization ⋮ On the generality of the greedy algorithm for solving matroid base problems ⋮ Shortest path with acceleration constraints: complexity and approximation algorithms ⋮ A class of exponential neighbourhoods for the quadratic travelling salesman problem




This page was built for publication:

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