Pages that link to "Item:Q1383928"
From MaRDI portal
The following pages link to Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem (Q1383928):
Displaying 50 items.
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
- The multi-objective generalized consistent vehicle routing problem (Q320011) (← links)
- Choquet optimal set in biobjective combinatorial optimization (Q336494) (← links)
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
- Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890) (← links)
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958) (← links)
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
- Bi-objective optimization of retailer's profit and customer surplus in assortment and pricing planning (Q828848) (← links)
- A biobjective method for sample allocation in stratified sampling (Q856297) (← links)
- An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (Q869006) (← links)
- Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
- Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
- Using support vector machines to learn the efficient set in multiple objective discrete optimization (Q958095) (← links)
- The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem (Q989830) (← links)
- Exact algorithm for bi-objective 0-1 knapsack problem (Q990717) (← links)
- What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods? (Q993470) (← 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)
- Computation of ideal and Nadir values and implications for their use in MCDM methods. (Q1406960) (← links)
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm. (Q1413848) (← links)
- An interactive heuristic method for multi-objective combinatorial optimization (Q1569903) (← links)
- A bicriteria knapsack program for planning remediation of contaminated lightstation sites (Q1598774) (← links)
- Dominance for multi-objective robust optimization concepts (Q1622793) (← links)
- A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem (Q1694319) (← links)
- Fathoming rules for biobjective mixed integer linear programs: review and extensions (Q1751199) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems (Q1754323) (← links)
- Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (Q1873011) (← links)
- Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives (Q1877893) (← links)
- The biobjective travelling purchaser problem (Q1885751) (← links)
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
- Bridging game theory and the knapsack problem: a theoretical formulation (Q1990251) (← links)
- B{\&}B method for discrete partial order optimization (Q2010369) (← links)
- Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem (Q2379863) (← links)
- Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← links)
- A discussion of scalarization techniques for multiple objective integer programming (Q2379880) (← links)
- Fuzzy approach to multilevel knapsack problems (Q2387353) (← links)
