scientific article; zbMATH DE number 1517139
From MaRDI portal
Publication:4509378
DOI<1::AID-NET1>3.0.CO;2-B 10.1002/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-BzbMath0969.90072MaRDI QIDQ4509378
Publication date: 10 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
An optimal algorithm for the obstacle neutralization problem ⋮ A penalty search algorithm for the obstacle neutralization problem ⋮ The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ On the directed hop-constrained shortest path problem ⋮ Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope ⋮ A complete characterization of jump inequalities for the hop-constrained shortest path problem ⋮ On cardinality constrained cycle and path polytopes ⋮ Facets of the \((s,t)-p\)-path polytope ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Characterization of facets of the hop constrained chain polytope via dynamic programming ⋮ A column generation heuristic for a dynamic generalized assignment problem
Uses Software
Cites Work
- Efficient piecewise-linear function approximation using the uniform metric
- A Data-Reduction Strategy for Splines with Applications to the Approximation of Functions and Data
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
