Andere Kunden interessierten sich auch für
![Simultaneous Confidence Bounds]( "Simultaneous Confidence Bounds")
Simultaneous Confidence Bounds32,99 €![Polygon Semi regular Low Density Parity Check Codes]( "Polygon Semi regular Low Density Parity Check Codes")
Polygon Semi regular Low Density Parity Check Codes32,99 €![Multiple Comparisons for Mixed Models]( "Multiple Comparisons for Mixed Models")
Multiple Comparisons for Mixed Models51,99 €![Non/Semi-parametric Instrumental Variables Models for Economic Data]( "Non/Semi-parametric Instrumental Variables Models for Economic Data")
Non/Semi-parametric Instrumental Variables Models for Economic Data32,99 €![Multiple Testing Procedures under dependence, with applications]( "Multiple Testing Procedures under dependence, with applications")
Multiple Testing Procedures under dependence, with applications38,99 €![Simultaneous Equations]( "Simultaneous Equations")
Simultaneous Equations25,99 €![Simultaneous Statistical Inference]( "Simultaneous Statistical Inference")
Simultaneous Statistical Inference110,99 €
Over the last sixty years, the study of network flows
has led to some of the most appealing and useful
results in applied mathematics, including efficient
algorithms for certain linear and combinatorial
optimization problems. This text continues this
journey and presents a novel approach to relate
binary-constrained integer programs to a new class of
(semi-)simultaneous network flows. The exposition of
the material is fully self-contained and first
provides a thorough review of the most important
concepts from both integer and network flow
programming, as well as the theory of computational
complexity. All new results are developed and
explained in much detail, illustrated on over 20
examples and more than 30 figures, and used for the
implementation of several algorithms. C++ and model
codes are included. Originally prepared and written
during completion of the author''s diploma studies,
this book is well-suited for advanced students and
active researchers who are interested in general
advances of operations research and mathematical
programming. Also available from VDM is the
dissertation title "Beyond Pareto Optimality -
Domination and Decomposition in Multiobjective
Programming."
has led to some of the most appealing and useful
results in applied mathematics, including efficient
algorithms for certain linear and combinatorial
optimization problems. This text continues this
journey and presents a novel approach to relate
binary-constrained integer programs to a new class of
(semi-)simultaneous network flows. The exposition of
the material is fully self-contained and first
provides a thorough review of the most important
concepts from both integer and network flow
programming, as well as the theory of computational
complexity. All new results are developed and
explained in much detail, illustrated on over 20
examples and more than 30 figures, and used for the
implementation of several algorithms. C++ and model
codes are included. Originally prepared and written
during completion of the author''s diploma studies,
this book is well-suited for advanced students and
active researchers who are interested in general
advances of operations research and mathematical
programming. Also available from VDM is the
dissertation title "Beyond Pareto Optimality -
Domination and Decomposition in Multiobjective
Programming."