scientific article
From MaRDI portal
Publication:2753949
zbMath0974.68215MaRDI QIDQ2753949
Mark Ziegelmann, Kurt Mehlhorn
Publication date: 18 December 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items
An experimental study of random knapsack problems ⋮ Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context ⋮ Modelling the mobile target covering problem using flying drones ⋮ On the cardinality of the Pareto set in bicriteria shortest path problems ⋮ A penalty search algorithm for the obstacle neutralization problem ⋮ Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price ⋮ Solving resource constrained shortest path problems with LP-based methods ⋮ The transit time constrained fixed charge multi-commodity network design problem ⋮ Computing representations using hypervolume scalarizations ⋮ Unnamed Item ⋮ A computational study of solution approaches for the resource constrained elementary shortest path problem ⋮ Online covering with \(\ell_q\)-norm objectives and applications to network design ⋮ Cost-based filtering for shorter path constraints ⋮ The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach ⋮ Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints ⋮ A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation ⋮ Dynamic programming approaches to solve the shortest path problem with forbidden paths ⋮ Solving the constrained shortest path problem using random search strategy ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ Bicriteria Data Compression ⋮ On Accuracy of Approximation for the Resource Constrained Shortest Path Problem
Uses Software
