Item request has been placed!

Item request cannot be made.

Processing Request

نتائج البحث

Display Settings

النتائج لكل صفحة: 10

Sort By: Relevance

Filter

فلترة النتائج

Publication : mathematical programming

إعادة تعيين خيارات الفبترة

Item request has been placed!

Item request cannot be made.

Processing Request

Academic Journal

A constant-factor approximation for generalized malleable scheduling under M♮-concave processing speeds.

Authors : Fotakis, Dimitris¹ (AUTHOR); Matuschke, Jannik² (AUTHOR) ; Papadigenopoulos, Orestis³ (AUTHOR)

Source: Mathematical Programming. Jul2024, Vol. 206 Issue 1/2, p515-539. 25p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

First order asymptotics of the sample average approximation method to solve risk averse stochastic programs.

Authors : Krätschmer, Volker¹ (AUTHOR)

Source: Mathematical Programming. Nov2024, Vol. 208 Issue 1/2, p209-242. 34p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Hardness and approximation of submodular minimum linear ordering problems.

Authors : Farhadi, Majid¹ (AUTHOR); Gupta, Swati² (AUTHOR) ; Sun, Shengding¹ (AUTHOR)

Source: Mathematical Programming. Nov2024, Vol. 208 Issue 1/2, p277-318. 42p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

A unified stochastic approximation framework for learning in games.

Authors : Mertikopoulos, Panayotis¹ (AUTHOR) ; Hsieh, Ya-Ping² (AUTHOR); Cevher, Volkan³ (AUTHOR)

Source: Mathematical Programming. Jan2024, Vol. 203 Issue 1/2, p559-609. 51p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Approximation algorithms for flexible graph connectivity.

Authors : Boyd, Sylvia¹ (AUTHOR); Cheriyan, Joseph² (AUTHOR) ; Haddadan, Arash³ (AUTHOR)

Source: Mathematical Programming. Mar2024, Vol. 204 Issue 1/2, p493-516. 24p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Improving the approximation ratio for capacitated vehicle routing.

Authors : Blauth, Jannis¹ (AUTHOR) ; Traub, Vera² (AUTHOR); Vygen, Jens¹ (AUTHOR)

Source: Mathematical Programming. Feb2023, Vol. 197 Issue 2, p451-497. 47p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

An approximation algorithm for indefinite mixed integer quadratic programming.

Authors : Pia, Alberto Del¹ (AUTHOR)

Source: Mathematical Programming. Sep2023, Vol. 201 Issue 1/2, p263-293. 31p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

A tight approximation algorithm for the cluster vertex deletion problem.

Authors : Aprile, Manuel¹ (AUTHOR); Drescher, Matthew² (AUTHOR); Fiorini, Samuel² (AUTHOR)

Source: Mathematical Programming. Feb2023, Vol. 197 Issue 2, p1069-1091. 23p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings.

Authors : Rieger, Alon¹ (AUTHOR); Segev, Danny¹ (AUTHOR)

Source: Mathematical Programming. Nov2024, Vol. 208 Issue 1/2, p111-171. 61p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Approximation algorithms for the generalized incremental knapsack problem.

Authors : Faenza, Yuri¹ (AUTHOR); Segev, Danny² (AUTHOR) ; Zhang, Lingyi¹ (AUTHOR)

Source: Mathematical Programming. Mar2023, Vol. 198 Issue 1, p27-83. 57p.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

نتائج البحث

فلترة النتائج

A constant-factor approximation for generalized malleable scheduling under M♮-concave processing speeds.

First order asymptotics of the sample average approximation method to solve risk averse stochastic programs.

Hardness and approximation of submodular minimum linear ordering problems.

A unified stochastic approximation framework for learning in games.

Approximation algorithms for flexible graph connectivity.

Improving the approximation ratio for capacitated vehicle routing.

An approximation algorithm for indefinite mixed integer quadratic programming.

A tight approximation algorithm for the cluster vertex deletion problem.

Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings.

Approximation algorithms for the generalized incremental knapsack problem.

اتصل بنا

اتبع