Search Results - "programming: integer algorithms"

Order Assignment and Scheduling in a Supply Chain by Chen, Zhi-Long, Pundoor, Guruprasad

“…We consider the supply chain of a manufacturer who produces time-sensitive products that have a large variety, a short life cycle, and are sold in a very short…”
Get full text

Global Optimality Conditions for Discrete and Nonconvex Optimization--With Applications to Lagrangian Heuristics and Column Generation by Larsson, Torbjorn, Patriksson, Michael

“…The well-known and established global optimality conditions based on the Lagrangian formulation of an optimization problem are consistent if and only if the…”
Get full text

An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem by Talbot, F. Brian, Patterson, James H

“…In this paper, we describe an integer programming algorithm for assigning tasks on an assembly line to work stations in such a way that the number of work…”
Get full text

Note--Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems by Granot, Frieda

“…) problem of finding a 0-1 vector x that maximizes c T x subject to f ( x ) b where c , b 0 and f is an m -vector of polynomials with non-negative coefficients…”
Get full text

Covering Relaxation for Positive 0-1 Polynomial Programs by Granot, Daniel, Granot, Frieda, Kallberg, Jerry

“…Granot and Hammer (Granot, F., P. L. Hammer. 1971. On the use of boolean functions in 0-1 programming. Operations Research, Statistics and Economic Mimeograph…”
Get full text

Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction by Pisinger, W. David, Rasmussen, Anders Bo, Sandvik, Rune

“…The quadratic knapsack problem (QKP) calls for maximizing a quadratic objective function subject to a knapsack constraint…”
Get full text

Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems by Granot, Frieda

“…) problem of finding a 0-1 vector x that maximizes cTx subject to f(x) ≤ b where c, b ≥ 0 and f is an m-vector of polynomials with non-negative coefficients…”
Get full text