Integer Linear Programming Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replace - " (2008)" to " (2008)") |
m (Text replacement - "<B><U>AKA</U>:</B>" to "<B>AKA:</B>") |
||
| Line 1: | Line 1: | ||
An [[Integer Linear Programming Algorithm]] is a [[linear programming algorithm]] that can solve an [[Integer Linear Programming Task]]. | An [[Integer Linear Programming Algorithm]] is a [[linear programming algorithm]] that can solve an [[Integer Linear Programming Task]]. | ||
* <B | * <B>AKA:</B> [[Integer Programming]], [[IP]], [[Integer Linear Programming]], [[ILP]]. | ||
* <B><U>Example(s)</U>:</B> | * <B><U>Example(s)</U>:</B> | ||
** a [[Branch and Bound Algorithm]]. | ** a [[Branch and Bound Algorithm]]. | ||
Revision as of 14:09, 9 September 2014
An Integer Linear Programming Algorithm is a linear programming algorithm that can solve an Integer Linear Programming Task.
- AKA: Integer Programming, IP, Integer Linear Programming, 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.