Data Structures and Computer Science Techniques in Operations Research
From MaRDI portal
Publication:4178750
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)- Computer generation of hypergeometric random variates†
- 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
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)