Exact algorithm for bi-objective 0-1 knapsack problem (Q990717): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.amc.2007.04.062
+Normal rank
@@ Property / OpenAlex ID @@
+W2058891234
@@ Property / OpenAlex ID: W2058891234 / rank @@
+Normal rank
@@ Property / cites work @@
+Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
+Normal rank
@@ Property / cites work @@
+Theory and algorithms for linear multiple objective programs with zero–one variables
+Normal rank
@@ Property / cites work @@
+Solving zero-one multiple objective programs through implicit enumeration
+Normal rank
@@ Property / cites work @@
+A method for generating all efficient solutions of 0-1 multi-objective linear programming problem
+Normal rank
@@ Property / cites work @@
+Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs
+Normal rank
@@ Property / cites work @@
+New trends in exact algorithms for the \(0-1\) knapsack problem
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
+Normal rank
@@ Property / cites work @@
+Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
+Normal rank
@@ Property / cites work @@
+A survey and annotated bibliography of multiobjective combinatorial optimization
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:990717