Search Results for: A Branch And Bound Algorithm For Multiobjective Mixed Integer Convex Optimization

Stefan Rocktäschel introduces a branch-and-bound algorithm that determines a cover of the efficient set of multiobjective mixed-integer convex optimization pro

The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics that show the spectrum of research, the richness of ideas, a

An accessible treatment of the modeling and solution of integer programming problems, featuring modern applications and software In order to fully comprehend th

A unified view of metaheuristics This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms t

This book presents solutions to the general problem of single period portfolio optimization. It introduces different linear models, arising from different perfo