Suchergebnisse - "mixed binary programming"

New optimization models for optimal classification trees von Ales, Zacharie, Huré, Valentine, Lambert, Amélie

“… The most efficient state-of-the-art methods to build classification trees are greedy heuristics (e.g. CART) that may fail to find underlying characteristics in …”
Volltext

Bi-objective optimisation over a set of convex sub-problems von Cabrera-Guerrero, Guillermo, Ehrgott, Matthias, Mason, Andrew J., Raith, Andrea

“… During the last decades, research in multi-objective optimisation has seen considerable growth. However, this activity has been focused on linear, non-linear, …”
Volltext

Multistage Transmission Expansion Planning Considering Fixed Series Compensation Allocation von Rahmani, Mohsen, Vinasco, Guillermo, Rider, Marcos J., Romero, Ruben, Pardalos, Panos M.

“… cost compared with planning without FSCs. This problem is modeled as a linear mixed binary programming problem and is solved by a commercial branch-and-cut solver to obtain the optimum solution …”
Volltext

Optimizing Network Flows with Congestion-Based Flow Reductions von Bish, Douglas R., Chamberlayne, Edward P., Rakha, Hesham A.

“… When optimizing traffic systems using time-expanded network flow models, traffic congestion is an important consideration because it can decrease both the …”
Volltext

Bayesian Stopping Rules for Greedy Randomized Procedures von Orsenigo, Carlotta, Vercellis, Carlo

“… A greedy randomized adaptive search procedure (GRASP) is proposed for the approximate solution of general mixed binary programming problems (MBP …”
Volltext

Long-term scheduling in underground coal mining using mixed binary programming von West-Hansen, Jan

“… Recognizing the complexity of coal mining management, e.g., the scarcity of financial resources and the high level of uncertainty, a mixed binary programming …”
Volltext

Stochastic red-blue set covering: a decomposition approach von Islip, David, Kwon, Roy H.

“… This work presents the two-stage stochastic red-blue set covering problem (2S-SRBSC). The red-blue set covering problem (RBSC) selects a subcollection of sets …”
Volltext

Multistage transmission expansion planning considering fixed series compensation allocation von Rahmani, Mohsen, Vinasco, Guillermo, Rider, Marcos J., Romero, Ruben, Pardalos, Panos M.

“… cost compared with planning without FSCs. This problem is modeled as a linear mixed binary programming problem and is solved by a commercial branch-and-cut solver to obtain the optimum solution …”
Volltext

The long-term mine production scheduling problem von SARIN, SUBHASH C., WEST-HANSEN, JAN

“… sections of a mine, in this paper, we develop a mixed-binary programming model as an aid for generating …”
Volltext

Efficient identification of Wiener systems using a combination of atomic norm minimization and interval matrix properties von Yilmaz, Burak, Sznaier, Mario

“… Semi-Definite Programs. To circumvent this difficulty, in this paper we present an alternative, based on a combining properties of interval matrices with atomic norm minimization and mixed binary programming …”
Volltext

Aggregate Capacitated Lot-Size Scheduling for a Class of Flexible Machining and Assembly Systems von TOCZYLOWSKI, EUGENTUSZ, HINDI, KHALIL S.

“… Three different approaches for efficiently solving the resulting mixed binary programming problem are presented and discussed …”
Volltext