A dual heuristic for mixed integer programming (Q1785392): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Using diversification, communication and parallelism to solve mixed-integer linear programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The feasibility pump / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Local branching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3993418 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions / rank | |||
Normal rank |
Latest revision as of 17:48, 16 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A dual heuristic for mixed integer programming |
scientific article |
Statements
A dual heuristic for mixed integer programming (English)
0 references
28 September 2018
0 references
dual heuristic
0 references
branch-and-bound
0 references
knapsack
0 references
relaxations
0 references
0 references