Computational Combinatorial Optimization Optimal or Provably Near-Optimal Solutions

Computational Combinatorial Optimization Optimal or Provably Near-Optimal Solutions / edited by Michael Jünger, Denis Naddef.

This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation a...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Jünger, Michael (Editor), Naddef, Denis (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
Edition:1st ed. 2001.
Series:Lecture Notes in Computer Science, 2241
Springer eBook Collection.
Subjects:
Mathematical optimization.
Computer science—Mathematics.
Algorithms.
Information technology.
Business—Data processing.
Data structures (Computer science).
Combinatorics.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Login for hold information

‌

Click to view e-book

Online

Holdings details from Online
Call Number: E-Book
Status: Available

Similar Items