Data Structures and Computer Science Techniques in Operations Research

DOI10.1287/OPRE.26.5.686MaRDI QIDQ4178750zbMATH OpenOpenAlexFDO

Authors

Publication date 1978

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.26.5.686

zbMATH Keywords

BibliographyComputer Science TechniquesData StructuresImplementation Of Algorithms

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Numerical mathematical programming methods (65K05) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Algorithms in computer science (68W99) Operations research and management science (90Bxx) Applications of mathematical programming (90C90)

Cited in

(11)

• A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
• Ersatzteilbemessung für reparierbare Geräte. Grundlegende Modelle und Verfahren
• An algorithm for finding the \(k\) quickest paths in a network
• Finding the first \(K\) shortest paths in a time-window network.
• Finding the \(K\) shortest paths in a schedule-based transit network
• Finding \(K\) shortest looping paths in a traffic-light network
• The first K shortest unique-arc walks in a traffic-light network
• Finding \(K\) shortest looping paths with waiting time in a time--window network
• Computer generation of hypergeometric random variates†
• Solution techniques for some allocation problems
• On a multicriteria shortest path problem

This page was built for publication: Data Structures and Computer Science Techniques in Operations Research

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