An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
From MaRDI portal
Recommendations
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- An exact algorithm for biobjective mixed integer linear programming problems
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- Minimum effort approximation of the Pareto space of convex bi-criteria problems
- A general approximation method for bicriteria minimization problems
Cites work
- \(\epsilon\)-solutions in vector minimization problems
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- A new technique for analyzing substructures in arrangements of piecewise linear surfaces
- A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
- Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
- An approximation method for the efficiency set of multiobjective programming problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- Approximating the Pareto front of multi-criteria optimization problems
- Approximation methods in multiobjective programming
- Approximation of convex bodies by polytopes
- Bi-objective optimisation over a set of convex sub-problems
- Efficiently computing succinct trade-off curves
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- Hypervolume-based multiobjective optimization: theoretical foundations and practical implications
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Multicriteria Optimization
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- On the Lambert \(w\) function
- On the quality of discrete representations in multiple objective programming
- Scalarizations for adaptively solving multi-objective optimization problems
- Solving multiobjective mixed integer convex optimization problems
- The convergence rate of the sandwich algorithm for approximating convex functions
- Tractable approximate robust geometric programming
Cited in
(7)- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- A fast and robust algorithm for solving biobjective mixed integer programs
- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
- An approximation algorithm for multiobjective mixed-integer convex optimization
- A test instance generator for multiobjective mixed-integer optimization
- A solver for multiobjective mixed-integer convex and nonconvex optimization
- Test instances for multiobjective mixed-integer nonlinear optimization
This page was built for publication: An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055294)
