Citeseer/The precedence constrained knapsack problem — Separating maximally violated inequalities (2012) 10.1.1.353.1088 — различия между версиями
Материал из DISCOPAL
StasFomin (обсуждение | вклад) (Новая страница: «{{checked|}} {{citeseerlink|citeseer/The precedence constrained knapsack problem — Separating maximally violated inequalities (2012) 10.1.1.353.1088|<html> </…») |
StasFomin (обсуждение | вклад) |
||
Строка 1: | Строка 1: | ||
{{checked|}} | {{checked|}} | ||
− | {{citeseerlink|citeseer/The precedence constrained knapsack problem — Separating maximally violated inequalities (2012) 10.1.1.353.1088| | + | {{citeseerlink|citeseer/The precedence constrained knapsack problem — Separating maximally violated inequalities (2012) 10.1.1.353.1088| |
+ | We consider the problem of separating maximally violated inequalities for the precedence constrained knapsack problem. | ||
− | + | Though we consider maximally violated constraints in general, special emphasis is placed on induced cover inequalities and induced clique inequalities. | |
+ | |||
+ | Our contributions include a new partial characterization of maximally violated inequalities, a new safe shrinking technique, and new insights on strengthening and lifting. | ||
+ | }} | ||
{{enddiv}} | {{enddiv}} | ||
[[Категория:CiteSeerArticles]] | [[Категория:CiteSeerArticles]] |
Версия 20:51, 23 ноября 2021
«The precedence constrained knapsack problem — Separating maximally violated inequalities (2012) 10.1.1.353.1088»скачать
«
We consider the problem of separating maximally violated inequalities for the precedence constrained knapsack problem.
Though we consider maximally violated constraints in general, special emphasis is placed on induced cover inequalities and induced clique inequalities.
Our contributions include a new partial characterization of maximally violated inequalities, a new safe shrinking technique, and new insights on strengthening and lifting.
…»