Data Structures and Computer Science Techniques in Operations Research

DOI10.1287/OPRE.26.5.686zbMATH Open0395.90026OpenAlexW2163526781MaRDI QIDQ4178750FDOQ4178750

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

BibliographyData StructuresComputer Science TechniquesImplementation Of Algorithms

Mathematics Subject Classification ID

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

Cited In (11)

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

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)