Výsledky vyhľadávania - 0-1 mixed integer linear programming problem

Heuristic approaches for biobjective mixed 0–1 integer linear programming problems Autor Soylu, Banu

“…In this study, biobjective mixed 0–1 integer linear programming problems are considered and two heuristic approaches are presented to find the Pareto frontier of these problems…”
Získať plný text

Constraint violation reduction search for 0-1 mixed integer linear programming problems Autor Bansal, Ankit, Uzsoy, Reha

“…This article presents Constraint Violation Reduction Search (CVRS), a primal heuristic for 0-1 Mixed Integer Linear Programming (MILP) problems…”
Získať plný text

Improved convergent heuristics for the 0-1 multidimensional knapsack problem Autor Hanafi, Saïd, Wilbaut, Christophe

“… This process is suitable for the 0-1 mixed integer programming problems when the number of constraints is relatively smaller when compared to the number of variables…”
Získať plný text

Minimising negative externalities cost using 0-1 mixed integer linear programming model in e-commerce environment Autor Tetteh, Akyene, Dsane-Nsor, Sarah

“…: The 0-1 mixed integer linear programming (0-1 MILP) model was used to model the problem statement…”
Získať plný text

A simple technique to improve linearized reformulations of fractional (hyperbolic) 0–1 programming problems Autor Borrero, Juan S., Gillen, Colin, Prokopyev, Oleg A.

“…We consider reformulations of fractional (hyperbolic) 0–1 programming problems as equivalent mixed-integer linear programs (MILP…”
Získať plný text

New Branch-and-Cut Algorithm for Bilevel Linear Programming Autor Audet, C., Savard, G., Zghal, W.

“…Linear mixed 0-1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP) problems…”
Získať plný text

Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems Autor Sherali, Hanif D, Adams, Warren P, Driscoll, Patrick J

“… representation for linear mixed integer 0-1 problems. This hierarchy is an extension of the Reformulation-Linearization Technique of Sherali and Adams (1990, 1994…”
Získať plný text

Two stage beamforming and combining scheme for FDD massive MIMO systems with multi‐antenna users Autor Zheng, Wu, Liu, Chen, Song, Yunchao, Gao, Tianbao

“… To solve this problem, it is further transformed into an 0–1 mixed linear integer programming problem…”
Získať plný text

An enhanced 0-1 mixed-integer LP formulation for traffic signal control Autor Lin, W.-H., Wang, C.

“…An enhanced 0-1 mixed-integer linear programming formulation based on the cell-transmission model is proposed for the traffic signal optimization problem…”
Získať plný text

Multi-step methods for choosing the best set of variables in regression analysis Autor Konno, Hiroshi, Takaya, Yoshihiro

“…–1 integer linear programming problem and showed that it can be solved by the state-of-the-art integer programming software…”
Získať plný text

Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming Autor Eckstein, Jonathan, Nediak, Mikhail

“…This paper describes a heuristic for 0-1 mixed-integer linear programming problems, focusing on "stand-alone" implementation…”
Získať plný text

Sensor Scheduling using a 0-1 Mixed Integer Programming Framework Autor Chhetri, A.S., Morrell, D., Papandreou-Suppappola, A.

“… We first formulate the scheduling problem as a binary (0-1) nonlinear programming (NLP) problem. Using a linearization technique, we then convert the 0-1 NLP problem into a 0-1 mixed integer programming…”
Získať plný text

Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem Autor Montemanni, Roberto, Smith, Derek H.

“…A stochastic version of the 0–1 Knapsack Problem recently introduced in the literature and named the 0…”
Získať plný text

A hybrid heuristic for the 0–1 Knapsack Sharing Problem Autor Haddar, Boukthir, Khemakhem, Mahdi, Hanafi, Saïd, Wilbaut, Christophe

“…•The proposed approach can be easily adapted to other variants of knapsack problems.•New valid constraints are used to speed up the reduced problems solved inside ILPH…”
Získať plný text

An exponential cone integer programming and piece-wise linear approximation approach for 0-1 fractional programming Autor Pham, Hoang Giang, Ta, Thuy Anh, Mai, Tien

“… These problems are known to be NP-hard to approximate within any constant factor, and existing solution approaches typically rely on mixed-integer linear programming or second-order cone programming reformulations…”
Získať plný text

Fault diagnosis in power transformers using multi-class logical analysis of data Autor Mortada, Mohamad-Ali, Yacout, Soumaya, Lakis, Aouni

“… These patterns are found by solving a mixed 0–1 integer linear programming problem. They are then used to detect…”
Získať plný text

Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations Autor Mehmanchi, Erfan, Gómez, Andrés, Prokopyev, Oleg A.

“…) in their general structure. In particular, we explore the links between equivalent mixed-integer linear programming and conic quadratic programming reformulations of FPs…”
Získať plný text

Dynamic Lagrangian dual and reduced RLT constructs for solving 0–1 mixed-integer programs Autor Sherali, Hanif D., Smith, J. Cole

“…–1 linear programming problems. Similarly to delayed relax-and-cut approaches, the procedure dynamically appends valid inequalities to the linear programming relaxation as induced by the Reformulation-Linearization Technique (RLT…”
Získať plný text

Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search Autor Devriendt, Jo, Gleixner, Ambros, Nordström, Jakob

“…) relaxation is infeasible over the reals. Inspired by mixed integer programming (MIP), we address this problem by interleaving incremental LP solving with cut generation within the conflict-driven pseudo-Boolean search…”
Získať plný text

Solving a class of feature selection problems via fractional 0–1 programming Autor Mehmanchi, Erfan, Gómez, Andrés, Prokopyev, Oleg A.

“… The considered solution methods perform well for medium- and reasonably large-sized datasets, where the existing mixed-integer linear programs from the literature fail…”
Získať plný text