3250 search results - page 27 / 650 » An Algorithm to Solve a Linear Program |
SIAMJO
2010
13 years 6 months ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
GECCO
2000
Springer
14 years 1 days ago
2000
Springer
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
IJCM
2002
13 years 8 months ago
2002
JACIII
2007
13 years 8 months ago
2007
WINE
2005
Springer
14 years 1 months ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...