Item request has been placed!

Item request cannot be made.

Processing Request

نتائج البحث

Display Settings

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

Sort By: Relevance

Filter

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

Publication : operations research letters

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

Item request has been placed!

Item request cannot be made.

Processing Request

A note on the quickest minimum cost transshipment problem

Authors : Martin Skutella

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); Applied Mathematics

Source: Operations Research Letters. 51:255-258

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

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

On the approximation ratio of the 3-Opt algorithm for the (1,2)-TSP

Authors : Xianghui Zhong

Subjects: FOS: Computer and information sciences; 021103 operations research; Discrete Mathematics (cs.DM)

Source: Operations Research Letters. 49:515-521

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

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

A polyhedral approach to bisubmodular function minimization

Authors : Simge Küçükyavuz; Qimeng Yu

Subjects: FOS: Computer and information sciences; Convex hull; Mathematical optimization

Source: Operations Research Letters. 49:5-10

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

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

k-additive upper approximation of TU-games

Authors : Agnieszka Rusinowska; Michel Grabisch;

Subjects: Computer Science::Computer Science and Game Theory; Class (set theory); 021103 operations research

Source: Operations Research LettersOperations Research Letters, Elsevier, 2020, 48 (4), pp.487-492. ⟨10.1016/j.orl.2020.06.001⟩

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

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

The complexity of computing a robust flow

Authors : Yann Disser; Jannik Matuschke

Subjects: FOS: Computer and information sciences; 021103 operations research; Discrete Mathematics (cs.DM)

Source: Operations Research Letters. 48:18-23

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

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

Layers and matroids for the traveling salesman’s paths

Authors : Anke van Zuylen; András Sebő; Frans Schalekamp ...

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); Linear programming

Source: Operations Research LettersOperations Research Letters, Elsevier, 2018, 46, pp.60-63. ⟨10.1016/j.orl.2017.11.002⟩

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

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

Integrality gap of the vertex cover linear programming relaxation

Authors : Mohit Singh

Subjects: FOS: Computer and information sciences; 021103 operations research; Discrete Mathematics (cs.DM)

Source: Operations Research Letters. 47:288-290

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

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

Fixed-charge transportation problems on trees

Authors : Gustavo Angulo; Mathieu VanVyve

Subjects: FOS: Computer and information sciences; Discrete mathematics; Class (set theory)

Source: Operations Research Letters. 45:275-281

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

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

Shifted matroid optimization

Authors : Asaf Levin; Shmuel Onn

Subjects: FOS: Computer and information sciences; Optimization problem; Discrete Mathematics (cs.DM)

Source: Operations Research Letters. 44:535-539

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

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

Improved bound on the worst case complexity of Policy Iteration

Authors : Jean-Charles Delvenne; Romain Hollanders; Raphaël M. Jungers

Subjects: FOS: Computer and information sciences; Mathematical optimization; 021103 operations research

Source: Operations Research Letters. 44:267-272

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

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

نتائج البحث

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

A note on the quickest minimum cost transshipment problem

On the approximation ratio of the 3-Opt algorithm for the (1,2)-TSP

A polyhedral approach to bisubmodular function minimization

k-additive upper approximation of TU-games

The complexity of computing a robust flow

Layers and matroids for the traveling salesman’s paths

Integrality gap of the vertex cover linear programming relaxation

Fixed-charge transportation problems on trees

Shifted matroid optimization

Improved bound on the worst case complexity of Policy Iteration

اتصل بنا

اتبع