The following pages link to (Q4945108):
Displaying 39 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems (Q339623) (← links)
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
- On a biobjective search problem in a line: formulations and algorithms (Q393048) (← links)
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890) (← links)
- Multiple criteria dynamic programming and multiple knapsack problem (Q529961) (← links)
- Connectedness of efficient solutions in multiple objective combinatorial optimization (Q650207) (← links)
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206) (← links)
- Guided moth-flame optimiser for multi-objective optimization problems (Q828882) (← links)
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity (Q839491) (← links)
- Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study (Q853072) (← links)
- Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
- The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem (Q989830) (← links)
- What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods? (Q993470) (← links)
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579) (← links)
- Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm. (Q1413848) (← links)
- The multiscenario lot size problem with concave costs. (Q1426700) (← links)
- Heuristic allocation based on a dynamic programming state-space representation (Q1602778) (← links)
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems (Q1652447) (← links)
- Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
- Multiobjective solution of the uncapacitated plant location problem (Q1869487) (← links)
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
- Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
- A trade-off multiobjective dynamic programming procedure and its application to project portfolio selection (Q2150774) (← links)
- Pareto optimal allocations and dynamic programming (Q2267303) (← links)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- Fuzzy approach to multilevel knapsack problems (Q2387353) (← links)
- A survey of recent developments in multiobjective optimization (Q2468335) (← links)
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem (Q2503277) (← links)
- Punctuality and idleness in just-in-time scheduling (Q2566707) (← links)
- The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
- The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization (Q2988849) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Improved smoothed analysis of multiobjective optimization (Q5415491) (← links)
- The smoothed number of Pareto-optimal solutions in bicriteria integer optimization (Q6044982) (← links)
- Ordinal optimization through multi-objective reformulation (Q6096566) (← links)
