Analyse de sensibilité pour les problèmes linéaires en variables 0-1
From MaRDI portal
Publication:5479828
DOI10.1051/ro:2004002zbMath1101.68715OpenAlexW2099642335MaRDI QIDQ5479828
Bruno Bachelet, Philippe Mahey
Publication date: 11 July 2006
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2003__37_4_221_0
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
A faster strongly polynomial time algorithm to solve the minimum cost tension problem ⋮ An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem ⋮ Finding an optimal Nash equilibrium to the multi-agent project scheduling problem ⋮ An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem ⋮ Nash equilibria for the multi-agent project scheduling problem with controllable processing times ⋮ Aggregation approach for the minimum binary cost tension problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Penelope's graph: a hard minimum cost tension instance
- Parallel recognition of series-parallel graphs
- An efficient scheme to solve two problems for two-terminal series parallel graphs
- Topology of series-parallel networks
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- The Recognition of Series Parallel Digraphs
- Linear-time computability of combinatorial problems on series-parallel graphs
- Linear-time computation of optimal subgraphs of decomposable graphs
- Convex Analysis
- An “out-of-kilter” algorithm for solving minimum cost potential problems
This page was built for publication: Analyse de sensibilité pour les problèmes linéaires en variables 0-1
