Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming (Q1603339): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A note on modeling multiple choice requirements for simple mixed integer programming solvers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the calculation of true and pseudo penalties in multiple choice integer programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational comparison on the partitioning strategies in multiple choice integer programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multiple choice programming: A state-of-the-art review / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4103327 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improved penalty calculations for a mixed integer branch-and-bound algorithm / rank | |||
Normal rank | |||
Latest revision as of 10:45, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming |
scientific article |
Statements
Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming (English)
0 references
11 July 2002
0 references
0 references
0 references
