Optimization by Nemhauser George (59 results)

hardcover. Condition: Very Good. Sturdy hardcover, nice covers with some light shelf wear, clean pages and solid spine, no markings or highlighting within text. CC.

Condition: Good. 1 Edition. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Hardcover. Condition: Very Good. No Jacket. Very good, clean, tight condition. Black hardcover, no jacket. Text free of marks. Professional book dealer since 1999. All orders are processed promptly and carefully packaged.

Paperback. Condition: Fair. 1. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condition: acceptable. Book shows noticeable wear from use. May include writing, highlighting, or other markings, but not excessive. Cover or edges may have visible wear. The book remains complete and fully readable.

Paperback. Condition: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

SOFTCOVER. Condition: Very Good. Reprint Edition. Large octavo softcover; 763 pp. B/w tables and figures. Tight binding, clean throughout. Light edge wear; one light (discrete) 5 inch crease to top of front wrap. Very Good. Wiley-Interscience Series in Discrete Mathematics and Optimization.

XI, 607 s. fig. Hardcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Handbooks in operations research, vol. 12. Sprache: Englisch. …

Condition: New.

Paperback or Softback. Condition: New. Integer Programming and Combinatorial Optimization: 10th International Ipco Conference, New York, Ny, Usa, June 7-11, 2004, Proceedings. Book.

Condition: As New. Unread book in perfect condition.

Condition: New.

Hardcover. Condition: Fair. 1. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: New. pp. 464.

Condition: New.

Softcover. Condition: Very Good. 1999 Soft Cover Edition. Corner crease to pgs. 471 & 475. Otherwise pages are clean & unmarked. Moderate shelf wear to covers. Pages.

Softcover. Condition: Gut. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 90 NEM 9780471359432 Sprache: Englisch Gewicht in Gramm: 1500.…

Condition: As New. Unread book in perfect condition.

Condition: Like New. hardcover. Text block firm and clean, binding unblemished, boards straight, without highlights or underlining. Fine, like new condition. Previous owners nam on title page. Supporting Bay Area Friends of the Library since 2010. Well packaged and promptly shipped.

Condition: Very Good. hardcover. Page block firm and clean, binding unblemished, boards straight, without markings of any kind. Light blue cloth. Supporting Bay Area Friends of the Library since 2010. Well packaged and promptly shipped.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Session 1.- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.- Metric Inequalities and the Network Loading Problem.- Valid Inequalities Based on Simple Mixed-Integer Sets.- Session 2.- The Price of Anarchy when Costs Are Non-separable and Asymmetric.- Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem.- Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games.- Session 3.- A Robust Optimization Approach to Supply Chain Management.- Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems.- Scheduling an Industrial Production Facility.- Session 4.- Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs.- A TDI Description of Restricted 2-Matching Polytopes.- Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems.- Session 5.- Semi-continuous Cuts for Mixed-Integer Programming.- Combinatorial Benders' Cuts.- A Faster Exact Separation Algorithm for Blossom Inequalities.- Session 6.- LP-based Approximation Algorithms for Capacitated Facility Location.- A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem.- Separable Concave Optimization Approximately Equals Piecewise Linear Optimization.- Session 7.- Three Kinds of Integer Programming Algorithms Based on Barvinok's Rational Functions.- The Path-Packing Structure of Graphs.- More on a Binary-Encoded Coloring Formulation.- Session 8.- Single Machine Scheduling with Precedence Constraints.- The Constrained Minimum Weighted Sum of Job Completion Times Problem.- Session 9.- Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption.- A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts.-All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables.- Session 10.- A Capacity Scaling Algorithm for M-convex Submodular Flow.- Integer Concave Cocirculations and Honeycombs.- Minsquare Factors and Maxfix Covers of Graphs.- Session 11.- Low-Dimensional Faces of Random 0/1-Polytopes.- On Polyhedra Related to Even Factors.- Optimizing over Semimetric Polytopes.…