Pages that link to "Item:Q1296117"
From MaRDI portal
The following pages link to A branch and bound algorithm for mixed zero-one multiple objective linear programming (Q1296117):
Displaying 50 items.
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
- Efficient automated schematic map drawing using multiobjective mixed integer programming (Q337580) (← links)
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612) (← links)
- Multi-directional local search (Q339654) (← links)
- An exact algorithm for biobjective mixed integer linear programming problems (Q342401) (← links)
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958) (← links)
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming (Q814696) (← links)
- A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← links)
- Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
- Branch and bound method for multiobjective pairing selection (Q980932) (← links)
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419) (← links)
- A hybrid approach for biobjective optimization (Q1662163) (← links)
- Fathoming rules for biobjective mixed integer linear programs: review and extensions (Q1751199) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems (Q1754323) (← links)
- A multiple criteria decision-aid approach in defining national priorities for greenhouse gases emissions reduction in the energy sector (Q1869524) (← links)
- Bi-objective optimisation over a set of convex sub-problems (Q2108798) (← links)
- Bi-objective design-for-control of water distribution networks with global bounds (Q2138314) (← links)
- Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems (Q2274869) (← links)
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (Q2286918) (← links)
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization (Q2297563) (← links)
- A fuzzy approach for bi-level integer non-linear programming problem (Q2369068) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example (Q2379867) (← links)
- A discussion of scalarization techniques for multiple objective integer programming (Q2379880) (← links)
- Two phase algorithms for the bi-objective assignment problem (Q2455615) (← links)
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs (Q2672116) (← links)
- Branch-and-bound and objective branching with three or more objectives (Q2676405) (← links)
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method (Q2802241) (← links)
- A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem (Q2815467) (← links)
- A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level (Q2821098) (← links)
- Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration (Q4911457) (← links)
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems (Q5055294) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Solving Multiobjective Mixed Integer Convex Optimization Problems (Q5131967) (← links)
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
- Branch-and-Bound for Bi-objective Integer Programming (Q5139633) (← links)
- A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method (Q5139845) (← links)
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
- A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems (Q6048167) (← links)
- Exact method based on solution space cut for bi-objective Seru production (Q6059586) (← links)
- An exact criterion space search method for a bi-objective nursing home location and allocation problem (Q6102633) (← links)
