Integer Programming and Combinatorial Optimization

DOI10.1007/B97946zbMATH Open1092.90007OpenAlexW2484779063MaRDI QIDQ5712466FDOQ5712466

Authors: Satoru Iwata, Satoko Moriguchi, Kazuo Murota 

Publication date: 23 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b97946

Recommendations

• A capacity scaling algorithm for M-convex submodular flow
• Capacity scaling algorithm for scalable M-convex submodular flow problems
• A capacity scaling algorithm for convex cost submodular flows
• A faster capacity scaling algorithm for minimum cost submodular flow
• A fast cost scaling algorithm for submodular flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cited In (9)

• Title not available (Why is that?)
• Applications of discrete convex analysis to mathematical economics
• A capacity scaling algorithm for the constrained maximum flow problem
• L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
• A fast cost scaling algorithm for submodular flow
• Coordinatewise domain scaling algorithm for M-convex function minimization
• A capacity scaling algorithm for M-convex submodular flow
• Capacity scaling algorithm for scalable M-convex submodular flow problems
• Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization

This page was built for publication: Integer Programming and Combinatorial Optimization

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