Pages that link to "Item:Q2250114"

The following pages link to An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114):

Displaying 17 items.

• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming (Q1567067) (← links)
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
• A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (Q1652440) (← links)
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
• An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program (Q2119757) (← links)
• An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
• Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← links)
• Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization (Q2669645) (← links)
• Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes (Q2790887) (← links)
• Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102) (← links)
• Efficient algorithms for solving nonlinear fractional programming problems (Q5080834) (← links)
• A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs (Q5087716) (← links)
• Solving multiplicative programs by binary-encoding the multiplication operation (Q6047881) (← links)
• Exact method based on solution space cut for bi-objective Seru production (Q6059586) (← links)
• A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)
• Advancements in the computation of enclosures for multi-objective optimization problems (Q6113330) (← links)
• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)