Integer Linear Programming Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "]] ** " to "]]. ** ") |
m (Text replacement - "]] *** " to "]]. *** ") |
||
| Line 16: | Line 16: | ||
* http://en.wikipedia.org/wiki/Linear_programming#Integer_unknowns | * http://en.wikipedia.org/wiki/Linear_programming#Integer_unknowns | ||
** QUOTE: Advanced algorithms for solving integer linear programs include: | ** QUOTE: Advanced algorithms for solving integer linear programs include: | ||
*** [[cutting-plane method]] | *** [[cutting-plane method]]. | ||
*** [[branch and bound]] | *** [[branch and bound]]. | ||
*** [[branch and cut]] | *** [[branch and cut]] | ||
*** [[branch and price]]. | *** [[branch and price]]. | ||
Revision as of 00:45, 24 July 2023
An Integer Linear Programming Algorithm is a linear programming algorithm that can solve an integer linear programming task.
- AKA: Integer Programming, IP, ILP.
- Example(s):
- Counter-Example(s):
- See: Linear Programming Task.
References
2009
- http://en.wikipedia.org/wiki/Linear_programming#Integer_unknowns
- QUOTE: Advanced algorithms for solving integer linear programs include:
- if the problem has some extra structure, it may be possible to apply delayed column generation.
2008
- (Vandenberghe, 2008) ⇒ Lieven Vandenberghe. (2008). “Lecture 17 - Integer Linear Programming." EE236A - Linear Programming (Fall 2007-08) UCLA
1998
- (Schrijver, 1998) ⇒ Alexander Schrijver. (1998). “Theory of Linear and Integer Programming." Wiley. ISBN:0471982326
- In this chapter we describe some introductory theory for integer linear programming.