Výsledky vyhľadávania - 0–1 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

Petri net representation and reachability analysis of 0–1 integer linear programming problems Autor Kodama, Akito, Nishi, Tatsushi

“…In this paper, we investigate a general algorithm for converting the 0–1 integer linear programming problem (0-1IP…”
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

Linear optimization of bipolar fuzzy relational equations with max-Łukasiewicz composition Autor Liu, Chia-Cheng, Lur, Yung-Yih, Wu, Yan-Kuen

“…-Łukasiewicz composition can be translated into a 0–1 integer linear programming problem and solved using integer optimization techniques…”
Získať plný text

The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0–1 problems Autor Guignard, Monique, Ahlatcioglu, Aykut

“…The convex hull heuristic is a heuristic for mixed-integer programming problems with a nonlinear objective function and linear constraints…”
Získať plný text

Using 0/1 mixed integer linear programming to solve a reliability-centered problem of power plant preventive maintenance scheduling Autor Perez Canto, Salvador

“… 0/1 mixed integer linear programming is used to solve the model reached. An application study is included. The model is put to use in a real power plant setting, representative of the Spanish one. The result obtained is a schedule that allows the efficient organization of preventive maintenance over a specific time horizon…”
Získať plný text

Managing product variety with mixed make-to-stock/make-to-order production strategy and guaranteed delivery time under stochastic demand Autor Kuthambalayan, Thyagaraj S., Bera, Samiran

“…–1 nonlinear programming problem with Greedy + B&B method. Firms often use a facility to produce both Make-to-Stock (MTS) and Make-to-Order (MTO) items…”
Získať plný text

Integrating operations and marketing decisions to manage perishability risks with target minimum remaining shelf-life available to consumers Autor Singh, Nitesh Kumar, Kuthambalayan, Thyagaraj S.

“… We study an aggregate level planning problem at the bottleneck packaging stage of a Make-and-Pack production system of perishable products and integrate sequencing decisions…”
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 Integer Programming Approach to Solving the Inverse Graph Model for Conflict Resolution with Two Decision Makers Autor Han, Yu, Xu, Haiyan, Fang, Liping, Hipel, Keith W.

“…–1 integer linear programming problem even when both DMs’ preferences are unknown. For the situation of SEQ, when both DMs…”
Získať plný text

Efficient REBTA data reporting algorithm for object tracking in wireless sensor networks Autor El‐Fouly, Fatma H., Ramadan, Rabie A., Mahmoud, Mohamed I., Dessouky, Moawad I.

“…Summary Object tracking is widely referred as one of the most interesting applications of wireless sensor networks (WSNs). This application is able to detect…”
Získať plný text

Data-driven multi-layered intelligent energy management system for domestic decentralized power distribution systems Autor Rahim, Sahar, Ahmad, Haseeb

“… and scheduling optimization problem with an aim to design an autonomous domestic complex, less reliant on the focal power grid…”
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

Unit commitment problem in deregulated environment Autor Bisanovic, Smajo, Hajro, Mensur, Dlakic, Muris

“… The self-scheduling model is formulated as deterministic optimization problem in which expected profit is maximized by 0/1 mixed-integer linear programming technique…”
Získať plný text

Supersparse linear integer models for optimized medical scoring systems Autor Ustun, Berk, Rudin, Cynthia

“…). SLIM scoring systems are built by using an integer programming problem that directly encodes measures of accuracy (the 0–1 loss) and sparsity (the ℓ 0 -seminorm…”
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

Using the sequential linear integer programming method as a post-processor for stress-constrained topology optimization problems Autor Werme, M.

“… In particular, the minimum compliance problem with stress constraints is considered. The finite element method is used to discretize the design domain into n finite elements and the design of a certain structure is represented by an n…”
Získať plný text

Neighbor-based joint spatial division and multiplexing in massive MIMO: user scheduling and dynamic beam allocation Autor Liang, Huibin, Liu, Chen, Song, Yunchao, Gao, Tianbao, Zou, Yulong

“… The user scheduling problem is formulated as a 0–1 quadratic programming problem to maximize effective spectral efficiency (ESE…”
Získať plný text

Top-k Feature Selection Framework Using Robust 0-1 Integer Programming Autor Zhang, Xiaoqin, Fan, Mingyu, Wang, Di, Zhou, Peng, Tao, Dacheng

“…Feature selection (FS), which identifies the relevant features in a data set to facilitate subsequent data analysis, is a fundamental problem in machine learning and has been widely studied in recent years…”
Získať plný text

Modelling and solving profit-oriented U-shaped partial disassembly line balancing problem Autor Li, Zixiang, Janardhanan, Mukund Nilakantan

“…•Profit-oriented U-shaped partial disassembly line balancing problem is studied.•Mixed-integer linear programming model is developed for the proposed problem…”
Získať plný text