نتائج البحث

Set characterizations and convex extensions for geometric convex-hull proofs.

• Authors : Bärmann, Andreas¹ (AUTHOR); Schneider, Oskar² (AUTHOR)

• Source: Mathematical Programming. Sep2022, Vol. 195 Issue 1/2, p475-515. 41p.

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

A 3-Slope Theorem for the infinite relaxation in the plane.

• Authors : Cornuéjols, Gérard¹ ; Molinaro, Marco¹

• Source: Mathematical Programming. Dec2013, Vol. 142 Issue 1/2, p83-105. 23p.

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

Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods.

• Authors : Das Gupta, Shuvomoy¹ (AUTHOR); Van Parys, Bart P. G.² (AUTHOR); Ryu, Ernest K.³ (AUTHOR)

• Source: Mathematical Programming. Mar2024, Vol. 204 Issue 1/2, p567-639. 73p.

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

On stress matrices of ( d + 1)-lateration frameworks in general position.

• Authors : Alfakih, A.¹ ; Taheri, Nicole² ; Ye, Yinyu³

• Source: Mathematical Programming. Feb2013, Vol. 137 Issue 1/2, p1-17. 17p.

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

Some 0/1 polytopes need exponential size extended formulations.

• Authors : Rothvoß, Thomas

Subjects: EXPONENTIAL functions; POLYTOPES; MATHEMATICAL formulas

• Source: Mathematical Programming; Dec2013, Vol. 142 Issue 1/2, p255-268, 14p

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

The symmetric quadratic traveling salesman problem.

• Authors : Fischer, Anja; Helmberg, Christoph

Subjects: TRAVELING salesman problem; QUADRATIC programming; TRANSPORTATION costs

• Source: Mathematical Programming; Dec2013, Vol. 142 Issue 1/2, p205-254, 50p

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

A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems.

• Authors : Izmailov, Alexey F.; Kurennoy, Alexey S.; Solodov, Mikhail V.

Subjects: LIPSCHITZ spaces; ERROR analysis in mathematics; MULTIPLIERS (Mathematical analysis)

• Source: Mathematical Programming; Dec2013, Vol. 142 Issue 1/2, p591-604, 14p

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

The Steiner connectivity problem.

• Authors : Borndörfer, Ralf; Karbstein, Marika; Pfetsch, Marc E.

Subjects: PUBLIC transit; TREE graphs; GRAPH connectivity

• Source: Mathematical Programming; Dec2013, Vol. 142 Issue 1/2, p133-167, 35p

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

How many matchings cover the nodes of a graph?

• Authors : Ferhat, Dehia Ait¹ (AUTHOR); Király, Zoltán² (AUTHOR); Sebő, András³ (AUTHOR)

• Source: Mathematical Programming. Jan2024, Vol. 203 Issue 1/2, p271-284. 14p.

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

Distributionally robust joint chance constraints with second-order moment information.

• Authors : Zymler, Steve; Kuhn, Daniel; Rustem, Berç

Subjects: SEMIDEFINITE programming; APPROXIMATION theory; PARAMETERS (Statistics)

• Source: Mathematical Programming; Feb2013, Vol. 137 Issue 1/2, p167-198, 32p, 1 Chart

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