A strongly polynomial algorithm for the minimum cost tension problem

DOI10.1016/S0012-365X(96)00185-9MaRDI QIDQ1356759zbMATH OpenWikidataFDO

Authors Malika Hadjiat, Jean-François Maurras

Publication date 30 October 1997

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

strongly polynomial algorithmminimum cost tension problemmin-mean-cost residual cut problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A faster strongly polynomial time algorithm to solve the minimum cost tension problem
• Miu Cost Tensions
• An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem
• A strongly polynomial minimum cost circulation algorithm
• scientific article; zbMATH DE number 3900474

Cites work

• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• scientific article; zbMATH DE number 3495892 (Why is no real title available?)
• scientific article; zbMATH DE number 1256704 (Why is no real title available?)
• scientific article; zbMATH DE number 742960 (Why is no real title available?)
• scientific article; zbMATH DE number 910862 (Why is no real title available?)
• A characterization of the minimum cycle mean in a digraph
• A strongly polynomial minimum cost circulation algorithm
• An “out-of-kilter” algorithm for solving minimum cost potential problems
• Finding minimum-cost circulations by canceling negative cycles
• Flots et tensions dans un graphe
• Minimum cuts, modular functions, and matroid polyhedra
• Miu Cost Tensions

Cited in

(10)

• Miu Cost Tensions
• scientific article; zbMATH DE number 3900474 (Why is no real title available?)
• An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem
• An analysis of the parameterized complexity of periodic timetabling
• A strongly polynomial minimum cost circulation algorithm
• Aggregation approach for the minimum binary cost tension problem
• Penelope's graph: a hard minimum cost tension instance
• A faster strongly polynomial time algorithm to solve the minimum cost tension problem
• New algorithms for convex cost tension problem with application to computer vision
• An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem

This page was built for publication: A strongly polynomial algorithm for the minimum cost tension problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356759)