scientific article
From MaRDI portal
Publication:3895490
zbMath0449.05014MaRDI QIDQ3895490
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Distance oracles for time-dependent networks ⋮ Complexity of some parametric integer and network programming problems ⋮ Optimal Embedding into Star Metrics ⋮ Balancing profits and costs on trees ⋮ Parametric multiple sequence alignment and phylogeny construction ⋮ On the complexity of time-dependent shortest paths ⋮ A fast parametric assignment algorithm with applications in max-algebra ⋮ Parametric min-cuts analysis in a network. ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering ⋮ An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
This page was built for publication:
