Search results
From MaRDI portal
- radiation therapy 2010-05-10 Paper Minimum cut bases in undirected networks 2010-05-05 Paper Capacity inverse minimum cost flow problem 2010-03-09 Paper Simultaneous...10 bytes (19 words) - 13:32, 8 December 2023
- strongly polynomial cut cancelling algorithms for minimum cost network flow 1994-01-02 Paper Canceling most helpful total cuts for minimum cost network flow 1993-06-29...10 bytes (19 words) - 11:24, 8 December 2023
- and some generalizatons 1999-03-14 Paper Minimum weight \((T,d)\)-joins and multi-joins 1998-11-01 Paper Minimum 0-extensions of graph metrics 1998-06-16...10 bytes (19 words) - 21:33, 11 December 2023
- of Publication Type Minimum cost subpartitions in graphs 2010-01-29 Paper A Deterministic Algorithm for Finding All Minimum k‐Way Cuts 2007-10-22 Paper A...10 bytes (16 words) - 18:19, 9 December 2023
- Alliances in Liner Shipping 2011-11-17 Paper Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems 2011-06-22...10 bytes (16 words) - 07:03, 12 December 2023
- degree constrained minimum spanning tree problem 2018-07-25 Paper Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained...10 bytes (20 words) - 00:18, 10 December 2023
- Complexity and online algorithms for minimum skyline coloring of intervals 2018-03-26 Paper Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded...10 bytes (17 words) - 16:41, 6 December 2023
- parametric global minimum cuts by random interleaving 2017-09-29 Paper Rounding algorithms for a geometric embedding of minimum multiway cut 2016-09-29 Paper...10 bytes (19 words) - 15:50, 10 December 2023
- parametric global minimum cuts in graphs and hypergraphs 2015-12-09 Paper A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts 2014-06-02...10 bytes (16 words) - 21:33, 11 December 2023
- uncapacitated concave minimum cost network flow problems 2006-09-13 Paper Lower bounds from state space relaxations for concave cost network flow problems...10 bytes (16 words) - 18:20, 9 December 2023
- 1999-11-14 Paper Computing maximum mean cuts 1994-07-31 Paper Two strongly polynomial cut cancelling algorithms for minimum cost network flow 1994-01-02 Paper Canceling...10 bytes (18 words) - 15:21, 6 October 2023
- optimization and oracle-based cuts 2020-08-28 Paper Strong NP-hardness of AC power flows feasibility 2020-02-10 Paper Intersection cuts for polynomial optimization...10 bytes (17 words) - 16:59, 6 December 2023
- inequalities 2001-01-01 Paper Minimum cost capacity installation for multicommodity network flows 1999-10-18 Paper A branch-and-cut algorithm for capacitated...10 bytes (16 words) - 05:38, 9 December 2023
- Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games 1982-01-01 Paper Minimum cost spanning tree games 1981-01-01...10 bytes (16 words) - 18:00, 9 December 2023
- in multi-product Cournot games 2020-06-18 Paper On minimum 3-cuts and approximating k-cuts using Cut Trees 2019-01-11 Paper A Simple and Efficient Algorithm...10 bytes (16 words) - 02:33, 13 December 2023
- probe 2020-10-23 Paper Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions 2019-10-15 Paper Holiest minimum-cost paths and flows in surface...10 bytes (16 words) - 05:33, 7 October 2023
- Unicyclic Connected Components: An Easy Problem 2011-07-18 Paper On the minimum cost multiple-source unsplittable flow problem 2011-06-01 Paper Virtual network...10 bytes (18 words) - 01:01, 10 December 2023
- amalgams 2000-07-05 Paper Minimum-time multidrop broadcast 1999-05-30 Paper Minimum self-repairing graphs 1998-06-29 Paper Minimum-cost line broadcast in paths...10 bytes (18 words) - 11:28, 13 December 2023
- to Combinatorial Problems 1976-01-01 Paper Minimum cuts and related problems 1975-01-01 Paper Minimal Cost Cut Equivalent Networks 1973-01-01 Paper A Graph-Theoretic...10 bytes (18 words) - 10:33, 7 October 2023
- piecewise-constant capacities 2002-04-22 Paper A faster capacity scaling algorithm for minimum cost submodular flow 2002-01-01 Paper Fast and simple approximation schemes...10 bytes (18 words) - 18:17, 9 December 2023
