Suchergebnisse - mixed binary integer programming (problem OR problems)~

A survey on the Artificial Bee Colony algorithm variants for binary, integer and mixed integer programming problems von Akay, Bahriye, Karaboga, Dervis, Gorkemli, Beyza, Kaya, Ebubekir

“… Binary optimization problems, integer and mixed integer programming problems are of this category, and they require suitable solution representation and search operators to be solved by nature-inspired algorithms …”
Volltext

Solving Mixed Integer Bilinear Problems Using MILP Formulations von Gupte, Akshay, Ahmed, Shabbir, Cheon, Myun Seok, Dey, Santanu

“… In this paper, we examine a mixed integer linear programming reformulation for mixed integer bilinear problems where each bilinearterm involves the product of a nonnegative integer variable …”
Volltext

A recombination‐based matheuristic for mixed integer programming problems with binary variables von Maravilha, André L., Carrano, Eduardo G., Campelo, Felipe

“… This work introduces a heuristic for mixed integer programming (MIP) problems with binary variables, based on information obtained from differences between feasible solutions as well as solutions from the linear relaxation …”
Volltext

An RLT approach for solving the binary-constrained mixed linear complementarity problem von Djeumou Fomeni, Franklin, Gabriel, Steven A., Anjos, Miguel F.

“… •We give a new way to solve binary-constrained mixed linear complementarity problems …”
Volltext

Classification of Dantzig–Wolfe reformulations for binary mixed integer programming problems von Jans, Raf

“… In this note, we provide a classification of Dantzig–Wolfe reformulations for Binary Mixed Integer Programming Problems …”
Volltext

Weighted iterated local branching for mathematical programming problems with binary variables von Rodrigues, Filipe, Agra, Agostinho, Hvattum, Lars Magnus, Requejo, Cristina

“… One way of implementing a local search procedure is by using a mixed-integer programming solver to explore a neighborhood defined through a constraint that limits the number of binary variables whose …”
Volltext

Computing non-stationary (s, S) policies using mixed integer linear programming von Xiang, Mengyuan, Rossi, Roberto, Martin-Barragan, Belen, Tarim, S. Armagan

“… •We introduce a mixed-integer linear programming reformulation.•Our reformulation can be solved by existing off-the-shelf solvers …”
Volltext

A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems von Fattahi, Ali, Turkay, Metin

“… the other. For a biobjective mixed-binary linear programming problem (BOMBLP), the NDF consists of some combination of isolated points and open, closed, or half-open/half-closed line segments …”
Volltext

On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory von Oberdieck, Richard, Diangelakis, Nikolaos A., Avraamidou, Styliani, Pistikopoulos, Efstratios N.

“… In multi-parametric programming an optimization problem is solved as a function of certain parameters, where the parameters are commonly considered to be bounded and continuous …”
Volltext

A binary bat algorithm with improved crossover operators and Cauchy mutation for unit commitment problem von Pang, Aokang, Liang, Huijun, Lin, Chenhao, Yao, Lei

“… Power system operators are faced with the problem of unit commitment belonging to mixed integer programming, which becomes very complicated, as units become large-scale and highly constrained …”
Volltext

Mixed model disassembly line balancing problem with fuzzy goals von Paksoy, Turan, Güngör, Aşkıner, Özceylan, Eren, Hancilar, Arif

“… In this paper, a mixed integer programming (MIP) model is proposed for a mixed model disassembly line balancing (MMDLB …”
Volltext

Binary decision rules for multistage adaptive mixed-integer optimization von Bertsimas, Dimitris, Georghiou, Angelos

“… On the other hand, existing binary decision rule structures tend to produce good quality solutions at the expense of limited scalability and are typically confined to worst-case optimization problems …”
Volltext

Calculating Global Minimum Points to Binary Polynomial Optimization Problem: Optimizing the Optimal PMU Localization Problem as a Case-Study von Theodorakatos, Nikolaos P., Moschoudis, Angelos P., Babu, Rohit

“… This paper concerns the implementation of proper algorithms embedded in optimization solvers to the optimal PMU localization problem solving globally …”
Volltext

Linear approximated formulation of AC optimal power flow using binary discretisation von Akbari, Tohid, Tavakoli Bina, Mohammad

“… While the AC-OPF is a non-linear programming problem, this can be transformed into a mixed-integer linear programming environment by the proposed model without loss of accuracy …”
Volltext

Single allocation hub location problems with congestion: Mixed-integer second-order cone programming and Benders decomposition von Hu, Qing-Mi, Hu, Shaolong

“… of the congestion cost. A novel Mixed-Integer Linear Programming (MILP) reformulation method utilizing the binary representation of non-negative integers and a strong Mixed-Integer Second-Order Cone Programming (MISOCP …”
Volltext

Determining r- and (r,s)-robustness of digraphs using mixed integer linear programming von Usevitch, James, Panagou, Dimitra

“… ,s)-robustness of digraphs using mixed integer linear programming; to the best of the authors’ knowledge it is the first time that mixed integer programming methods have been applied to the robustness …”
Volltext

SO-MI: A surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems von Müller, Juliane, Shoemaker, Christine A., Piché, Robert

“… This paper introduces a surrogate model based algorithm for computationally expensive mixed-integer black-box global optimization problems with both binary and non-binary integer variables …”
Volltext

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

“… Multi-objective mixed integer (linear or non-linear) programming has received considerably less attention …”
Volltext

Improved tight and effective two-binary-variable formulations for UC problems von Yang, Linfeng, Fang, Beihua, Zhang, Chen, Li, Wei

“… This study presents two mixed-integer programmings formulations for the unit commitment (UC) problem …”
Volltext

Compact linearization for binary quadratic problems subject to assignment constraints von Mallach, Sven

“… We introduce and prove new necessary and sufficient conditions to carry out a compact linearization approach for a general class of binary quadratic problems subject to assignment constraints …”
Volltext