Andere Kunden interessierten sich auch für
![Convex Relaxations for Mixed-Integer Nonlinear Programs]( "Convex Relaxations for Mixed-Integer Nonlinear Programs")
Convex Relaxations for Mixed-Integer Nonlinear Programs43,85 €![Variational Analysis and Aerospace Engineering]( "Variational Analysis and Aerospace Engineering")
Variational Analysis and Aerospace Engineering74,99 €![Operational Research]( "Operational Research")
Operational Research74,99 €![Approximation Methods for Polynomial Optimization]( "Approximation Methods for Polynomial Optimization")
Approximation Methods for Polynomial Optimization37,99 €![Production Planning by Mixed Integer Programming]( "Production Planning by Mixed Integer Programming")
Production Planning by Mixed Integer Programming59,99 €![Operational Research]( "Operational Research")
Operational Research74,99 €![Maximal Lattice-Free Polyhedra in Mixed-Integer Cutting Plane Theory]( "Maximal Lattice-Free Polyhedra in Mixed-Integer Cutting Plane Theory")
Maximal Lattice-Free Polyhedra in Mixed-Integer Cutting Plane Theory27,25 €
Stefan Rocktäschel introduces a branch-and-bound algorithm that determines a cover of the efficient set of multiobjective mixed-integer convex optimization problems. He examines particular steps of this algorithm in detail and enhances the basic algorithm with additional modifications that ensure a more precise cover of the efficient set. Finally, he gives numerical results on some test instances.