A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024): Difference between revisions

@@ Property / describes a project that uses @@
+k-Vertex-Cut-Problem
@@ Property / describes a project that uses: k-Vertex-Cut-Problem / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3045117486
@@ Property / OpenAlex ID: W3045117486 / rank @@
+Normal rank
@@ Property / cites work @@
+Coordinated cutting plane generation via multi-objective separation
+Normal rank
@@ Property / cites work @@
+Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria.
+Normal rank
@@ Property / cites work @@
+A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
+Normal rank
@@ Property / cites work @@
+Clique-based facets for the precedence constrained knapsack problem
+Normal rank
@@ Property / cites work @@
+A combinatorial column generation algorithm for the maximum stable set problem
+Normal rank
@@ Property / cites work @@
+Bilevel programming: a survey
@@ Property / cites work: Bilevel programming: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+General cut-generating procedures for the stable set polytope
+Normal rank
@@ Property / cites work @@
+A multi-KP modeling for the maximum-clique problem
+Normal rank
@@ Property / cites work @@
+Foundations of bilevel programming
@@ Property / cites work: Foundations of bilevel programming / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n) algorithm for the multiple-choice knapsack linear program
+Normal rank
@@ Property / cites work @@
+A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
+Normal rank
@@ Property / cites work @@
+A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
+Normal rank
@@ Property / cites work @@
+On the use of intersection cuts for bilevel optimization
+Normal rank
@@ Property / cites work @@
+Local branching
@@ Property / cites work: Local branching / rank @@
+Normal rank
@@ Property / cites work @@
+On integer and bilevel formulations for the \(k\)-vertex cut problem
+Normal rank
@@ Property / cites work @@
+The maximum clique interdiction problem
@@ Property / cites work: The maximum clique interdiction problem / rank @@
+Normal rank
@@ Property / cites work @@
+Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms
+Normal rank
@@ Property / cites work @@
+Strong lift-and-project cutting planes for the stable set problem
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Maximum-weight stable sets and safe lower bounds for graph coloring
+Normal rank
@@ Property / cites work @@
+A reactive local search-based algorithm for the disjunctively constrained knapsack problem
+Normal rank
@@ Property / cites work @@
+Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
+Normal rank
@@ Property / cites work @@
+An algorithm for the disjunctively constrained knapsack problem
+Normal rank
@@ Property / cites work @@
+A nonconvex quadratic optimization approach to the maximum edge weight clique problem
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Incremental Upper Bound for the Maximum Clique Problem
+Normal rank
@@ Property / cites work @@
+On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+A new upper bound for the maximum weight clique problem
+Normal rank
@@ Property / cites work @@
+A combinatorial branch-and-bound algorithm for box search
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+An upper bound for the zero-one knapsack problem and a branch and bound algorithm
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Speeding up branch and bound algorithms for solving the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Algorithms for the Bin Packing Problem with Conflicts
+Normal rank
@@ Property / cites work @@
+A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
+Normal rank
@@ Property / cites work @@
+The Knapsack Problem with Conflict Graphs
@@ Property / cites work: The Knapsack Problem with Conflict Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A minimal algorithm for the multiple-choice knapsack problem
+Normal rank
@@ Property / cites work @@
+A branch and cut solver for the maximum stable set problem
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the maximum cardinality stable set problem
+Normal rank
@@ Property / cites work @@
+A new branch-and-bound algorithm for the maximum edge-weighted clique problem
+Normal rank
@@ Property / cites work @@
+A new branch-and-bound algorithm for the maximum weighted clique problem
+Normal rank
@@ Property / cites work @@
+An improved bit parallel exact maximum clique algorithm
+Normal rank
@@ Property / cites work @@
+Infra-chromatic bound for exact maximum clique search
+Normal rank
@@ Property / cites work @@
+Q4640250
@@ Property / cites work: Q4640250 / rank @@
+Normal rank
@@ Property / cites work @@
+An exact bit-parallel algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Relaxed approximate coloring in exact maximum clique search
+Normal rank
@@ Property / cites work @@
+The Multiple-Choice Knapsack Problem
@@ Property / cites work: The Multiple-Choice Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
+Normal rank
@@ Property / cites work @@
+A review on algorithms for maximum clique problems
+Normal rank
@@ Property / cites work @@
+An O(n) algorithm for the linear multiple choice knapsack problem and related problems
+Normal rank