A simple recipe for concise mixed 0-1 linearizations (Q1886797): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60395653, #quickstatements; #temporary_batch_1712201099914 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank | |||
Normal rank | |||
Latest revision as of 14:28, 7 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple recipe for concise mixed 0-1 linearizations |
scientific article |
Statements
A simple recipe for concise mixed 0-1 linearizations (English)
0 references
19 November 2004
0 references
Integer programming
0 references
Nonlinear programming
0 references
Linearization
0 references
Binary optimization
0 references
