Suchergebnisse - purely combinatorial strongly polynomial algorithm

Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and ℓ ∞ -norm objectives von 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 …”
Volltext

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

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

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

“… We develop a strongly polynomial purely combinatorial algorithm to find such a packing …”
Volltext

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

“… We develop a purely combinatorial strongly polynomial solution algorithm …”
Volltext

Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and ℓ∞-norm objectives: Newton-type algorithms for inverse optimization von 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 …”
Volltext

Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $$\ell _\infty$$-norm objectives von 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 …”
Volltext

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

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

Bayesian Generalized Network Design von 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 …”
Volltext

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

Volltext

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

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