Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts (Q5387638): Difference between revisions

Latest revision as of 10:54, 28 June 2024

scientific article; zbMATH DE number 5279327

Language	Label	Description	Also known as
English	Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts	scientific article; zbMATH DE number 5279327

Statements

instance of

scholarly article

0 references

title

Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts (English)

0 references

zbMATH Open document ID

1142.90493

0 references

DOI

10.1007/978-3-540-68155-7_23

0 references

0 references

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

publication date

27 May 2008

0 references

Mathematics Subject Classification ID

0 references

0 references

Maximum Flow

0 references

Reoptimization

0 references

Robust Minimum Cut

0 references

describes a project that uses

MCFClass

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-68155-7_23

0 references

OpenAlex ID

W1590485676

0 references

cites work

Robust discrete optimization and network flows

0 references

Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time

0 references

On implementing the push-relabel method for the maximum flow problem

0 references

Market equilibrium via a primal--dual algorithm for a convex program

0 references

Maximal Flow Through a Network

0 references

A new approach to the maximum-flow problem

0 references

Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem

0 references

Optimal Protein Structure Alignment Using Maximum Cliques

0 references

Multiprocessor Scheduling with the Aid of Network Flow Algorithms

0 references

Investing in arcs in a network to maximize the expected max flow

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5387638

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-68155-7_23
+Normal rank
@@ Property / OpenAlex ID @@
+W1590485676
@@ Property / OpenAlex ID: W1590485676 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and network flows
@@ Property / cites work: Robust discrete optimization and network flows / rank @@
+Normal rank
@@ Property / cites work @@
+Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
+Normal rank
@@ Property / cites work @@
+On implementing the push-relabel method for the maximum flow problem
+Normal rank
@@ Property / cites work @@
+Market equilibrium via a primal--dual algorithm for a convex program
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
+Normal rank
@@ Property / cites work @@
+Optimal Protein Structure Alignment Using Maximum Cliques
+Normal rank
@@ Property / cites work @@
+Multiprocessor Scheduling with the Aid of Network Flow Algorithms
+Normal rank
@@ Property / cites work @@
+Investing in arcs in a network to maximize the expected max flow
+Normal rank