Handbook of combinatorial optimization. 1

Pirmais vāks
Dingzhu Du, Panos M. Pardalos
Springer Science & Business Media, 1998 - 2403 lappuses
The first of a multi-volume set, which deals with several algorithmic approaches for discrete problems as well as many combinatorial problems. It is addressed to researchers in discrete optimization, and to all scientists who use combinatorial optimization methods to model and solve problems.

No grāmatas satura

Lietotāju komentāri - Rakstīt atsauksmi

Ierastajās vietās neesam atraduši nevienu atsauksmi.

Saturs

Approximate Algorithms and Heuristics for MAXSAT
77
Connections between Nonlinear Programming
149
Interior Point Methods for Combinatorial Optimization 189 Interior Point Methods for Combinatorial Optimization
190
Knapsack Problems
299
Fractional Combinatorial Optimization
429
ReformulationLinearization Techniques
479
Gröbner Bases in Integer Programming
533
Applications of Set Covering Set Packing
573
Author Index
747
Subject Index
773
Autortiesības

Citi izdevumi - Skatīt visu

Bieži izmantoti vārdi un frāzes

Atsauces uz šo grāmatu

Bibliogrāfiskā informācija