Search Results - purely combinatorial strongly polynomial algorithm

Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and ℓ ∞ -norm objectives by Bérczi, Kristóf, Mendoza-Cadena, Lydia Mirabel, Varga, Kitti

“…In inverse optimization problems, we are given a feasible solution to an underlying optimization problem, and the goal is to modify the problem parameters so…”
Get full text

A network flow approach to a common generalization of Clar and Fries numbers by Bérczi-Kovács, Erika, Frank, András

“… The construction makes it possible to apply any standard cheapest network flow algorithm…”
Get full text

An efficient algorithm for packing cuts and (2,3)-metrics in a planar graph with three holes by Karzanov, Alexander V

“… We develop a strongly polynomial purely combinatorial algorithm to find such a packing…”
Get full text

A combinatorial algorithm for the planar multiflow problem with demands located on three holes by Babenko, Maxim A, Karzanov, Alexander V

“… We develop a purely combinatorial strongly polynomial solution algorithm…”
Get full text

Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and ℓ∞-norm objectives: Newton-type algorithms for inverse optimization by Bérczi, Kristóf, Mendoza-Cadena, Lydia Mirabel, Varga, Kitti

“…In inverse optimization problems, we are given a feasible solution to an underlying optimization problem, and the goal is to modify the problem parameters so…”
Get full text

Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $$\ell _\infty$$-norm objectives by Bérczi, Kristóf, Mendoza-Cadena, Lydia Mirabel, Varga, Kitti

“…In inverse optimization problems, we are given a feasible solution to an underlying optimization problem, and the goal is to modify the problem parameters so…”
Get full text

Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and \(\ell_\infty\)-norm objectives by Bérczi, Kristóf, Mendoza-Cadena, Lydia Mirabel, Varga, Kitti

“… For the weighted bottleneck Hamming distance objective, we present a simple, purely combinatorial…”
Get full text

Bayesian Generalized Network Design by Emek, Yuval, Kutten, Shay, Lavi, Ron, Shi, Yangguang

“…: Our main technical contribution is the development of (strongly) polynomial time algorithms for local decision making in the face of Bayesian uncertainty…”
Get full text

A Combinatorial Algorithm for the Minimum (2, r )-Metric Problem and Some Generalizations by Karzanov, Alexander V.

Get full text

Complete reducibility and general competitive equilibria in Cobb-Douglas economies by Krenzin, Kenneth Thomas

“… which are efficiently testable, that is, which can be verified or denied by a strongly polynomial algorithm…”
Get full text