scholarly journals Resource-Constrained Project Scheduling:Computing Lower Bounds by Solving Minimum Cut Problems

1999 ◽  
pp. 139-150 ◽  
Author(s):  
Rolf H. Möhring ◽  
Andreas S. Schulz ◽  
Frederik Stork ◽  
Marc Uetz
Keyword(s):  
Lower Bounds ◽  
Minimum Cut ◽  
Resource Constrained ◽  
Cut Problems

scholarly journals Ordered optimal solutions and parametric minimum cut problems

2005 ◽  
Vol 2 (2) ◽  
pp. 123-134 ◽  
Author(s):  
Shelby Brumelle ◽  
Daniel Granot ◽  
Li Liu
Keyword(s):  
Minimum Cut ◽  
Optimal Solutions ◽  
Cut Problems

scholarly journals On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems

2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
Vladimir Bondarenko ◽  
Andrei Nikolaev
Keyword(s):  
Time Complexity ◽  
Broad Class ◽  
Clique Number ◽  
Minimum Cut ◽  
Max Cut Problem ◽  
Cut Problems ◽  
Min Cut

We consider maximum and minimum cut problems with nonnegative weights of edges. We define the graphs of the cone decompositions and find a linear clique number for the min-cut problem and a superpolynomial clique number for the max-cut problem. These values characterize the time complexity in a broad class of algorithms based on linear comparisons.

scholarly journals A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms

1996 ◽  
Vol 65 (1-3) ◽  
pp. 167-190 ◽  
Author(s):  
Yang Dai ◽  
Hiroshi Imai ◽  
Kazuo Iwano ◽  
Naoki Katoh ◽  
Keiji Ohtsuka ◽  
...  
Keyword(s):  
Heuristic Algorithm ◽  
Minimum Cut ◽  
Cut Problems
Sign in / Sign up

Export Citation Format

Share Document