Threshold assignment algorithm

From MaRDI portal

Revision as of 11:06, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:3743115

Jump to:navigation, search

DOI10.1007/BFb0121086zbMath0605.90099MaRDI QIDQ3743115

Fred Glover, Randy Glover, Darwin D. Klingman

Publication date: 1986

Published in: Mathematical Programming Studies (Search for Journal in Brave)

zbMATH Keywords

assignment problem threshold algorithm polynomially bounded algorithm sequence of shortest path problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (10)

A user's guide to tabu search ⋮ Minimizing average project team size given multi-skilled workers with heterogeneous skill levels ⋮ Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange ⋮ Unnamed Item ⋮ Shortest paths algorithms: Theory and experimental evaluation ⋮ Parallel asynchronous algorithms for the \(K\) shortest paths problem ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange ⋮ The shortest path problem on large-scale real-road networks ⋮ Microcomputer-based algorithms for large scale shortest path problems

This page was built for publication: Threshold assignment algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3743115&oldid=17271442"