Bi-objective knapsack problem with conflicts
From MaRDI portal
Cites work
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- A fast algorithm for knapsack problem with conflict graph
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- A novel hybrid multi-objective algorithm to solve the generalized cubic cell formation problem
- A tutorial on multiobjective optimization: fundamentals and evolutionary methods
- Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
- Advanced network connectivity features and zonal requirements in covering location problems
- An algorithm for the disjunctively constrained knapsack problem
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Approximation of knapsack problems with conflict and forcing graphs
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Evolutionary Multi-Criterion Optimization
- Fixed set search matheuristic applied to the knapsack problem with forfeits
- Heuristics and lower bounds for the bin packing problem with conflicts
- scientific article; zbMATH DE number 2102225 (Why is no real title available?)
- Hybridizing carousel greedy and kernel search: a new approach for the maximum flow problem with conflict constraints
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
- Multi-objective optimization using metaheuristics: non-standard algorithms
- Network interdiction through length-bounded critical disruption paths: a bi-objective approach
- Optimization algorithms for the disjunctively constrained knapsack problem
- The Knapsack Problem with Conflict Graphs
- The knapsack problem with forfeit sets
- The knapsack problem with forfeits
- The maximum flow problem with conflict and forcing conditions
This page was built for publication: Bi-objective knapsack problem with conflicts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317438)
