Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
This book considers a range of problems in operations research, which are formulated through various mathematical models such as complementarity, variational inequalities, multiobjective optimization, fixed point problems, noncooperative games and inverse optimization.
The book covers financial flexibility, operational hedging, enterprise risk management (ERM), supply chain risk management (SCRM), integrated risk management (IRM), supply chain finance (SCF), and financial management of supply chain strategies.
The book covers financial flexibility, operational hedging, enterprise risk management (ERM), supply chain risk management (SCRM), integrated risk management (IRM), supply chain finance (SCF), and financial management of supply chain strategies.
This book provides a postgraduate audience the keys they need to understand and further develop a set of tools for the efficient computation of lower bounds and valid inequalities in integer programs and combinatorial optimization problems.
This book opens the door to multiobjective optimization for students in fields such as engineering, management, economics and applied mathematics. It offers a comprehensive introduction to multiobjective optimization, with a primary emphasis on multiobjective linear programming and multiobjective integer/mixed integer programming.
This book introduces readers to the main traffic flow modelling approaches and discusses their features and applications.
This book provides a handy, unified introduction to the theory of compact extended formulations of exponential-size integer linear programming (ILP) models.
This tutorial is the first comprehensive introduction to (possibly infinite) linear systems containing strict inequalities and evenly convex sets. Particular attention is paid to evenly convex polyhedra and finite linear systems containing strict inequalities.
Dynamic programming (DP) has a relevant history as a powerful and flexible optimization principle, but has a bad reputation as a computationally impractical tool.
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.