Computationally attractive nonlinear models for combinatorial optimisation (Q843386): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:21, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computationally attractive nonlinear models for combinatorial optimisation |
scientific article |
Statements
Computationally attractive nonlinear models for combinatorial optimisation (English)
0 references
12 October 2009
0 references
Summary: A common approach to many combinatorial problems is to model them as \(0/1\) linear programs. This approach enables the use of standard linear program-based optimisation methodologies that are widely employed by the operation research community. While this methodology has worked well for many problems, it can become problematic in cases where the linear programs generated become excessively large. In such cases, linear models can lose their computational viability. In recent years, several articles have explored the computational attractiveness of non-linear alternatives to the standard linear models typically adopted to represent such problems. In many cases, comparative computational testing yields results favouring the non-linear models by a wide margin. In this article, we summarise some of these successes in an effort to encourage a broader view of model construction than the conventional wisdom, i.e. linear modelling, typically affords.
0 references
integer programming
0 references
non-linear modelling
0 references
optimisation
0 references