• Suche: Approximation complexity of optimization problems

Treffer 81 - 100 von 26.474

81

On inverse traveling salesman problems
Chung, Yerim ; Demange, Marc
4OR: A Quarterly Journal of Operations Research. June 2012 10(2):193-209

Fachzeitschrift
Zu den Favoriten
82

Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization.
Ghadimi, Saeed ; Lan, Guanghui ; Zhang, Hongchao
Mathematical Programming. Jan2016, Vol. 155 Issue 1/2, p267-305. 39p.

STOCHASTIC processes ALGORITHMS CONSTRAINED optimization COMPUTATIONAL complexity STOCHASTIC programming
Fachzeitschrift
Zu den Favoriten
83

First and Zeroth-Order Implementations of the Regularized Newton Method with Lazy Approximated Hessians
Doikov, Nikita ; Grapiglia, Geovani Nunes
Journal of Scientific Computing. 103(1)

Fachzeitschrift
Zu den Favoriten
84

Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming.
Gondzio, Jacek ; Sobral, Francisco N. C.
Computational Optimization & Applications. Jun2025, Vol. 91 Issue 2, p649-681. 33p.

LINEAR programming COMPUTATIONAL mathematic... NONLINEAR equations LOW-rank matrices INTERIOR-point methods LINEAR systems …
Fachzeitschrift
Zu den Favoriten
85

Approximate Kernel Learning Uncertainty Set for Robust Combinatorial Optimization.
Loger, Benoît ; Dolgui, Alexandre ; Lehuédé, Fabien ; et al.
INFORMS Journal on Computing. May/Jun2024, Vol. 36 Issue 3, p900-917. 18p.

LINEAR programming SUPPLY chains ROBUST optimization COMBINATORIAL optimizati... ACADEMIE francaise
Fachzeitschrift
Zu den Favoriten
86

New limits of treewidth-based tractability in optimization
Faenza, Yuri ; Muñoz, Gonzalo ; Pokutta, Sebastian
Mathematical Programming: A Publication of the Mathematical Optimization Society. :1-36

Fachzeitschrift
Zu den Favoriten
87

K-adaptability in stochastic combinatorial optimization under objective uncertainty.
Buchheim, Christoph ; Pruente, Jonas
European Journal of Operational Research. Sep2019, Vol. 277 Issue 3, p953-963. 11p.

HEURISTIC COMBINATORIAL optimizati... NP-hard problems SPANNING trees COMPUTATIONAL complexity UNCERTAINTY …
Fachzeitschrift
Zu den Favoriten
88

Dieses Ergebnis kann Gästen nicht angezeigt werden.

89

Generalized CNF satisfiability, local reductions and complexity of succinctly specified problems
Radhakrishnan, V
Conference: 10. IEEE annual conference on structures in complexity theory,Las Vegas, NV (United States),May 1995; Other Information: PBD: [1995]

Konferenz
Zu den Favoriten
90

Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles.
Dalyac C ; Henriet L ; Jeandel E ; et al.
Publisher: Springer-Verlag, GmbH Country of Publication: Germany NLM ID: 101745262 Publication Model: Print-Electronic Cited Medium: Internet ISSN: 2196-0763 (Electronic) Linking ISSN: 21960763 NLM ISO Abbreviation: EPJ Quantum Technol Subsets: PubMed not MEDLINE

Fachzeitschrift
Zu den Favoriten
91

Oracle Complexity in Nonsmooth Nonconvex Optimization.
Kornowski, Guy ; Shamir, Ohad
Journal of Machine Learning Research. 2022, Vol. 23, p1-44. 44p.

MATHEMATICAL optimizatio... NONSMOOTH optimization
Fachzeitschrift
Zu den Favoriten
92

The Focal Multinomial Logit Model: Threshold Effects on Consumer Choice, Assortment, Pricing and Estimation.
Guan, Lei ; Nip, Kameng ; Wang, Ruxian ; et al.
Manufacturing & Service Operations Management (M&SOM). Dec2025, p1. 19p.

Fachzeitschrift
Zu den Favoriten
93

The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
Turkensteen, Marcel ; Malyshev, Dmitry ; Goldengorin, Boris ; et al.
Journal of Global Optimization: An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering. July 2017 68(3):601-622

Fachzeitschrift
Zu den Favoriten
94

A SINGLE TIMESCALE STOCHASTIC APPROXIMATION METHOD FOR NESTED STOCHASTIC OPTIMIZATION.
GHADIMI, SAEED ; RUSZCZYNSKI, ANDRZEJ ; MENGDI WANG
SIAM Journal on Optimization. 2020, Vol. 30 Issue 1, p960-979. 20p.

ALGORITHMS STOCHASTIC approximation SMOOTHNESS of functions SPECIAL functions LYAPUNOV functions CONSTRAINED optimization
Fachzeitschrift
Zu den Favoriten
95

Approximation issues of combinatorial optimization problems induced by optimal piecewise-linear learning procedures
Khachai, M. Yu.
Pattern Recognition and Image Analysis. June 2011 21(2):144-147

Fachzeitschrift
Zu den Favoriten
96

Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits.
Filippi, Carlo ; Stevanato, Elisa
Computers & Operations Research. Oct2013, Vol. 40 Issue 10, p2418-2428. 11p.

APPROXIMATION theory TRAVELING salesman probl... ALGORITHMS PROBLEM solving EMPIRICAL research COMBINATORIAL optimizati... …
Zeitschrift
Zu den Favoriten
97

An Arc Search Infeasible Interior-Point Algorithm for Symmetric Optimization Using a New Wide Neighborhood
Mansouri, H. ; Pirhaji, M. ; Zangiabadi, M.
Acta Applicandae Mathematicae: An International Research Journal on Applying Mathematics and Mathematical Applications. 157(1):75-91

Fachzeitschrift
Zu den Favoriten
98

Optimization under uncertainty: state-of-the-art and opportunities
Sahinidis, Nikolaos V.
In Computers and Chemical Engineering 2004 28(6):971-983

Fachzeitschrift
Zu den Favoriten
99

Inexact accelerated high-order proximal-point methods.
Nesterov, Yurii
Mathematical Programming. Jan2023, Vol. 197 Issue 1, p1-26. 26p.

CONVEX programming COMPLEXITY (Philosophy) CONTINUOUS functions
Fachzeitschrift
Zu den Favoriten
100

On the complexity and approximability of some Euclidean optimal summing problems
Eremeev, A. V. ; Kel’manov, A. V. ; Pyatkin, A. V.
Computational Mathematics and Mathematical Physics. October 2016 56(10):1813-1817

Fachzeitschrift
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter