The following pages link to Multi-objective branch and bound (Q1753506):
Displaying 25 items.
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization (Q1628126) (← links)
- Operations research for sustainability assessment of products: a review (Q1755223) (← links)
- B{\&}B method for discrete partial order optimization (Q2010369) (← links)
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
- Incomplete risk-preference information in portfolio decision analysis (Q2079418) (← links)
- On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming (Q2157908) (← links)
- Efficient allocation of resources to a portfolio of decision making units (Q2184153) (← links)
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms (Q2274873) (← links)
- Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm (Q2283932) (← links)
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← links)
- A decision space algorithm for multiobjective convex quadratic integer optimization (Q2669498) (← links)
- An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems (Q2669681) (← links)
- Branch-and-bound and objective branching with three or more objectives (Q2676405) (← links)
- Multiobjective Integer Programming: Synergistic Parallel Approaches (Q3386777) (← links)
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs (Q5139635) (← links)
- A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems (Q6048167) (← links)
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)
- An exact criterion space search method for a bi-objective nursing home location and allocation problem (Q6102633) (← links)
- Limit sets in global multiobjective optimization (Q6146954) (← links)
- \( \delta\)MOEA/D-AWACD: improving constant-distance-based MOEA/D-AWA using a step function parameter control mechanism (Q6168355) (← links)