Approximate and exact merging of knapsack constraints with cover inequalities

Autor: Fabio Vitor, Todd Easton
Rok vydání: 2020
Předmět:
Class (set theory)
TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES
Control and Optimization
Inequality
media_common.quotation_subject
Computer Science::Neural and Evolutionary Computation
MathematicsofComputing_NUMERICALANALYSIS
0211 other engineering and technologies
02 engineering and technology
Management Science and Operations Research
ComputingMethodologies_ARTIFICIALINTELLIGENCE
01 natural sciences
Computer Science::Discrete Mathematics
TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY
0101 mathematics
Computer Science::Data Structures and Algorithms
Integer programming
media_common
Mathematics
Discrete mathematics
021103 operations research
Applied Mathematics
010101 applied mathematics
Knapsack problem
Cover (algebra)
MathematicsofComputing_DISCRETEMATHEMATICS
Integer (computer science)
Zdroj: Optimization. 70:437-460
ISSN: 1029-4945
0233-1934
DOI: 10.1080/02331934.2020.1719492
Popis: This paper presents both approximate and exact merged knapsack cover inequalities, a class of cutting planes for knapsack and multiple knapsack integer programs. These inequalities combine the info...
Databáze: OpenAIRE
Externí odkaz: