Search Results - "Padberg, Manfred"

The Finite Sample Breakdown Point of l1-Regression.

Authors: Giloni, Avi Padberg, Manfred

Source: SIAM Journal on Optimization; 2004, Vol. 14 Issue 4, p1028-1042, 15p

ALMOST PERFECT MATRICES AND GRAPHS.

Authors: Padberg, Manfred manfred@padberg.com

Source: Mathematics of Operations Research (INFORMS). Feb2001, Vol. 26 Issue 1, p1-18. 18p. 3 Diagrams, 1 Graph.

ON THE UNCAPACITATED PLANT LOCATION PROBLEM II: FACETS AND LIFTING THEOREMS.

Authors: Cho, D. Chinhyung Padberg, Manfred W. Rao, M. R.

Source: Mathematics of Operations Research (INFORMS). Nov83, Vol. 8 Issue 4, p590-612. 23p.

ODD MINIMUM CUT-SETS AND b-MATCHINGS.

Authors: Padberg, Manfred W. Rao, M.R.

Source: Mathematics of Operations Research (INFORMS). Feb82, Vol. 7 Issue 1, p67-80. 14p.

Solving Airline Crew Scheduling Problems by Branch-and-Cut.

Authors: Hoffman, Karla L. Padberg, Manfred

Source: Management Science (INFORMS). Jun93, Vol. 39 Issue 6, p657-682. 26p.

SOLVING LARGE-SCALE SYMMETRIC TRAVELLING SALESMAN PROBLEMS TO OPTIMALITY.

Authors: Crowder, Harlan Padberg, Manfred W.

Source: Management Science (INFORMS). May80, Vol. 26 Issue 5, p495-509. 15p.

Improving LP-Representations of Zero-One Linear Programs for Branch and Cut.

Authors: Hoffman, Karla L. Padberg, Manfred

Source: ORSA Journal on Computing. Spring91, Vol. 3 Issue 2, p121. 14p.

A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges.

Authors: Hong, Saman Padberg, Manfred W.

Source: Operations Research. Sep/Oct1977, Vol. 25 Issue 5, p871. 4p.

THE TRIANGULAR E-MODEL OF CHANCE-CONSTRAINED PROGRAMMING WITH STOCHASTIC A-MATRIX.

Authors: Gochet, Willy F. Padberg, Manfred W.

Source: Management Science (INFORMS). May74, Vol. 20 Issue 9, p1284-1291. 8p.

A Note on Zero-One Programming.

Authors: Padberg, Manfred W.¹

Source: Operations Research. Jul/Aug1975, Vol. 23 Issue 4, p833. 5p.

On the Set-Covering Problem: II. An Algorithm for Set Partitioning.

Authors: Balas, Egon Padberg, Manfred

Source: Operations Research. Jan/Feb1975, Vol. 23 Issue 1, p74-90. 17p.

On the Set-Covering Problem.

Authors: Balas, Egon Padberg, Manfred W.

Source: Operations Research. Nov/Dec1972, Vol. 20 Issue 6, p1152-1161. 10p.

A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems.

Authors: Padberg, Manfred Rinaldi, Giovanni

Source: SIAM Review; March 1991, Vol. 33, p60-100, 41p

The rank of (mixed-) integer polyhedra.

Authors: Padberg, Manfred¹, manfred4@wanadoo.fr

Source: Mathematical Programming; Feb2013, Vol. 137 Issue 1/2, p593-599, 7p

Mixed-integer programming—1968 and thereafter.

Authors: Padberg, Manfred¹, manfred4@wanadoo.fr

Source: Annals of Operations Research; Feb2007, Vol. 149 Issue 1, p163-175, 13p, 1 Graph

Classical Cuts for Mixed-Integer Programming and Branch-and-Cut.

Authors: Padberg, Manfred¹, manfred4@wanadoo.fr

Source: Annals of Operations Research; Oct2005, Vol. 139 Issue 1-4, p321-352, 32p

THE FINITE SAMPLE BREAKDOWN POINT OF ℓ1-REGRESSION.

Authors: Giloni, Avi Padberg, Manfred

Source: SIAM Journal on Optimization. 2004, Vol. 14 Issue 4, p1028-1042. 15p. 1 Chart, 1 Graph.

Classical cuts for mixed-integer programming and branch-and-cut.

Authors: Padberg, Manfred

Source: Mathematical Methods of Operations Research. 2001, Vol. 53 Issue 2, p173. 31p.

Subjects: Integer programming, Cutting stock problem, Rings of integers

Packing small boxes into a big box.

Authors: Padberg, Manfred

Source: Mathematical Methods of Operations Research. 2000, Vol. 52 Issue 1, p1. 21p.

Subjects: Orthogonal functions, Integer programming, Polyhedral functions

TRAVELING SALESMAN PROBLEM.

Authors: Hoffman, Karla L. Padberg, Manfred

Source: Encyclopedia of Operations Research & Management Science. 2001, p849-853. 5p.