Výsledky vyhľadávania - purely combinatorial strongly polynomial algorithm
-
1
Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and ℓ ∞ -norm objectives
ISSN: 1862-4472, 1862-4480Vydavateľské údaje: Germany Springer Nature B.V 01.11.2025Vydané v Optimization letters (01.11.2025)“…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…”
Získať plný text
Journal Article -
2
A network flow approach to a common generalization of Clar and Fries numbers
ISSN: 0012-365X, 1872-681XVydavateľské údaje: Elsevier B.V 01.11.2024Vydané v Discrete mathematics (01.11.2024)“… The construction makes it possible to apply any standard cheapest network flow algorithm…”
Získať plný text
Journal Article -
3
An efficient algorithm for packing cuts and (2,3)-metrics in a planar graph with three holes
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 19.03.2018Vydané v arXiv.org (19.03.2018)“… We develop a strongly polynomial purely combinatorial algorithm to find such a packing…”
Získať plný text
Paper -
4
A combinatorial algorithm for the planar multiflow problem with demands located on three holes
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 27.10.2014Vydané v arXiv.org (27.10.2014)“… We develop a purely combinatorial strongly polynomial solution algorithm…”
Získať plný text
Paper -
5
Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and ℓ∞-norm objectives: Newton-type algorithms for inverse optimization
ISSN: 1862-4472, 1862-4480Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2025Vydané v Optimization letters (01.11.2025)“…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…”
Získať plný text
Journal Article -
6
Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $$\ell _\infty$$-norm objectives
ISSN: 1862-4472, 1862-4480Vydavateľské údaje: 01.11.2025Vydané v Optimization letters (01.11.2025)“…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…”
Získať plný text
Journal Article -
7
Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and \(\ell_\infty\)-norm objectives
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 28.02.2023Vydané v arXiv.org (28.02.2023)“… For the weighted bottleneck Hamming distance objective, we present a simple, purely combinatorial…”
Získať plný text
Paper -
8
Bayesian Generalized Network Design
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 30.06.2019Vydané v arXiv.org (30.06.2019)“…: Our main technical contribution is the development of (strongly) polynomial time algorithms for local decision making in the face of Bayesian uncertainty…”
Získať plný text
Paper -
9
A Combinatorial Algorithm for the Minimum (2, r )-Metric Problem and Some Generalizations
ISSN: 0209-9683, 1439-6912Vydavateľské údaje: 01.04.1998Vydané v Combinatorica (Budapest. 1981) (01.04.1998)Získať plný text
Journal Article -
10
Complete reducibility and general competitive equilibria in Cobb-Douglas economies
ISBN: 9798206642803Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.1988“… which are efficiently testable, that is, which can be verified or denied by a strongly polynomial algorithm…”
Získať plný text
Dissertation
