Výsledky vyhledávání - mixed binary (integer OR interier) programming problems

A survey on the Artificial Bee Colony algorithm variants for binary, integer and mixed integer programming problems Autor 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…”
Získat plný text

Solving Mixed Integer Bilinear Problems Using MILP Formulations Autor 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…”
Získat plný text

A recombination‐based matheuristic for mixed integer programming problems with binary variables Autor 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…”
Získat plný text

Computing non-stationary (s, S) policies using mixed integer linear programming Autor 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…”
Získat plný text

Effects of binary variables in mixed integer linear programming based unit commitment in large-scale electricity markets Autor Alemany, Juan, Kasprzyk, Leszek, Magnago, Fernando

“…•A direct link between relaxed binaries and computational burden cannot be assured. Mixed integer linear programming is one of the main approaches used to solve unit commitment problems…”
Získat plný text

Integrality gap minimization heuristics for binary mixed integer nonlinear programming Autor Melo, Wendel, Fampa, Marcia, Raupp, Fernanda

“…We present two feasibility heuristics for binary mixed integer nonlinear programming…”
Získat plný text

On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory Autor 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…”
Získat plný text

Optimal decision trees for categorical data via integer programming Autor Günlük, Oktay, Kalagnanam, Jayant, Li, Minhan, Menickelly, Matt, Scheinberg, Katya

“… In this paper, we present a mixed integer programming formulation to construct optimal decision trees of a prespecified size…”
Získat plný text

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

“…In this note, we provide a classification of Dantzig–Wolfe reformulations for Binary Mixed Integer Programming Problems…”
Získat plný text

Binary decision rules for multistage adaptive mixed-integer optimization Autor 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…”
Získat plný text

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

“…•We give a new way to solve binary-constrained mixed linear complementarity problems…”
Získat plný text

Weighted iterated local branching for mathematical programming problems with binary variables Autor 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…”
Získat plný text

Robust Low-Rank Matrix Recovery as Mixed Integer Programming via \ell -norm Optimization Autor Shi, Zhang-Lei, Li, Xiao Peng, Li, Weiguo, Yan, Tongjiang, Wang, Jian, Fu, Yaru

“… To this end, we model the RLRMR as a mixed integer programming (MIP) problem based on the <inline-formula><tex-math notation="LaTeX">\ell _{0}</tex-math></inline-formula>-norm. Then, a block coordinate descent…”
Získat plný text

A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems Autor 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…”
Získat plný text

Binary Sequence Set Optimization for CDMA Applications via Mixed-Integer Quadratic Programming Autor Yang, Alan, Mina, Tara, Gao, Grace

“… In this paper, we show that the ISL minimization problem may be formulated as a mixed-integer quadratic program (MIQP…”
Získat plný text

Linear approximated formulation of AC optimal power flow using binary discretisation Autor 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…”
Získat plný text

Foraging with MUSHROOMS: A Mixed-integer Linear Programming Scheduler for Multimessenger Target of Opportunity Searches with the Zwicky Transient Facility Autor Parazin, B., Coughlin, Michael W., Singer, Leo P., Gupta, Vaidehi, Anand, Shreya

“… commercial solvers that find globally optimal solutions to provided problems. We detail a new target-of-opportunity scheduling algorithm designed with Zwicky Transient Facility in mind that uses mixed-integer linear programming…”
Získat plný text

Binary extended formulations of polyhedral mixed-integer sets Autor Dash, Sanjeeb, Günlük, Oktay, Hildebrand, Robert

“…We analyze different ways of constructing binary extended formulations of polyhedral mixed-integer sets with bounded integer variables and compare their relative strength with respect to split cuts…”
Získat plný text

Determining r- and (r,s)-robustness of digraphs using mixed integer linear programming Autor 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…”
Získat plný text

Reduction in the number of binary variables for inter-sample avoidance in trajectory optimizers using mixed-integer linear programming Autor Afonso, Rubens J. M., Galvão, Roberto K. H., Kienitz, Karl H.

“…Summary This note proposes the use of a tuple encoding scheme to reduce the number of binary variables involved in trajectory optimization problems with inter…”
Získat plný text