Shortest chain subject to side constraints
From MaRDI portal
Publication:3664791
DOI10.1002/net.3230130212zbMath0516.90028OpenAlexW2098074159WikidataQ126263631 ScholiaQ126263631MaRDI QIDQ3664791
No author found.
Publication date: 1983
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230130212
optimal solutionside constraintsimplicit enumeration algorithmminimal cost-flow problemshortest chain
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)
Related Items (40)
Recoverable robust shortest path problems ⋮ Efficient chains in a network with time-cost trade-off function on each arc ⋮ A Lagrangean relaxation method for the constrained assignment problem ⋮ Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context ⋮ The constrained shortest path problem with stochastic correlated link travel times ⋮ On bicriterion minimal spanning trees: An approximation ⋮ Choquet optimal set in biobjective combinatorial optimization ⋮ Weighting factor extensions for finite multiple objective vector minimization problems ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price ⋮ The combination of continuous network design and route guidance ⋮ Solving resource constrained shortest path problems with LP-based methods ⋮ Simple paths with exact and forbidden lengths ⋮ Feeder routing for air-to-air refueling operations ⋮ Algorithms for the quickest path problem and the reliable quickest path problem ⋮ A constrained Steiner tree problem ⋮ Some heuristic methods for solving \(p\)-median problems with a coverage constraint ⋮ A computational study of solution approaches for the resource constrained elementary shortest path problem ⋮ Polynomial time approximation schemes for the constrained minimum spanning tree problem ⋮ Generalized multiple objective bottleneck problems ⋮ The resource constrained shortest path problem implemented in a lazy functional language ⋮ Cost-based filtering for shorter path constraints ⋮ Lagrangian relaxation and enumeration for solving constrained shortest-path problems ⋮ Maximum probability shortest path problem ⋮ Branch-and-price-and-cut for a service network design and hub location problem ⋮ A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation ⋮ Path optimization for the resource-constrained searcher ⋮ Nodal aggregation of resource constraints in a shortest path problem ⋮ Effective Algorithms for a Class of Discrete Valued Optimal Control Problems ⋮ Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem ⋮ Bi-criteria path problem with minimum length and maximum survival probability ⋮ The subdivision-constrained minimum spanning tree problem ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ Lagrangian relaxation for the multiple constrained robust shortest path problem ⋮ Traffic Networks and Flows over Time ⋮ Two engineering applications of a constrained shortest-path model ⋮ A penalty function heuristic for the resource constrained shortest path problem ⋮ Network flows with age dependent decay rates ⋮ Accelerated label setting algorithms for the elementary resource constrained shortest path problem ⋮ Solving the shortest path tour problem
Cites Work
This page was built for publication: Shortest chain subject to side constraints
