Suchergebnisse - "mixed-integer programming solvers"

On Optimization Over the Efficient Set of a Multiple Objective Linear Programming Problem von Sun, Erjiang

“… Instead of solving the problem directly, we introduce a new problem of minimizing the objective function subject to some linear constraints with additional binary variables …”
Volltext

Short-term benefits from central unit commitment and dispatch: Application to the Southern African Power Pool von Bowen, Brian Hugh

“… Electricity utilities in the Southern African region are conscious that gains could be made from more economically efficient trading but have had no tools with …”
Volltext

Multiple orders per job scheduling problems von Qu, Peng

“… The standard unit of transfer in new 300-mm semiconductor wafer fabrication facilities is the front opening unified pod (FOUP). Due to automated material …”
Volltext

Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity von Martins, Isabel, Alvelos, Filipe, Cerveira, Adelaide, Kašpar, Jan, Marušák, Robert

“… ‐purpose mixed integer programming solver (CPLEX). We compare the quality of the solutions obtained with both approaches for real instances. The branch‐and‐price approach found better solutions for the majority of the instances …”
Volltext

Constraints over Structured Domains von Gervet, Carmen

“… It addresses the bin-packing problem. The main constrained objects are the different bins, each describing a collection of unordered distinct elements, subject to disjointness constraints among them, weight constraints reflecting on each …”
Volltext

Dual Probability Learning Based Local Search for the Task Assignment Problem von Li, Zuocheng, Tang, Lixin, Hao, Jin-Kao

“… The task assignment problem (TAP) is concerned with assigning a set of tasks to a set of agents subject to the limited processing and memory capacities of each agent …”
Volltext

The freight allocation problem with all-units quantity-based discount: A heuristic algorithm von Qin, Hu, Luo, Meifeng, Gao, Xiang, Lim, Andrew

“… contracted. The task involves allocating projected demand of each shipping lane to shipping companies subject to the above …”
Volltext

A three-machine permutation flow-shop problem with minimum makespan on the second machine von Yanai, S, Fujie, T

“… By our computational experiments, the branch-and-bound algorithm is comparable to a recent mixed integer programming solver and, for some kinds of problem instances, the branch-and-bound algorithm …”
Volltext

A three-machine permutation flow-shop problem with minimum makespan on the second machine von S Yanai, T Fujie

Volltext

Strong valid inequalities for fluence map optimization problem under dose-volume restrictions von Tuncel, Ali T., Preciado, Felisa, Rardin, Ronald L., Langer, Mark, Richard, Jean-Philippe P.

“… We show that, when subject to dose-volume restrictions, these problems are NP-hard and that the linear programming relaxation of their natural mixed integer programming formulation can be arbitrarily weak …”
Volltext

An efficient technique for solving the scheduling of appliances in smart-homes von Hendrickx, Julien M., Jungers, Raphael M., Vankeerberghen, Guillaume, Wolsey, Laurence A.

“… In the development of the electricity grid, Demand Response is a current subject of research for reasons of robustness, efficiency and renewable energy integration …”
Volltext