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

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

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

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

A hybrid approach for solving mixed binary integer programming problems von Mat Shariff, Mastura Binti

“… Optimisation appears in many aspects of day to day life and more often, involves integer optimisation of very large scales …”
Volltext

Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling von Ziaee, Mohsen, Sadjadi, S.J.

“… The model is formulated in a form of mixed binary integer programming. The primary goal of this paper is to develop operation schedules that specify the completion time of operations …”
Volltext

Development of a new approach for deterministic supply chain network design von Mohammadi Bidhandi, Hadi, Mohd. Yusuff, Rosnah, Megat Ahmad, Megat Mohamad Hamdan, Abu Bakar, Mohd Rizam

“… Consequently, this problem is a binary mixed integer linear programming problem. In this paper, a modified version of Benders …”
Volltext

Mixed binary integer programming formulations for the reentrant job shop scheduling problem von Pan, Jason Chao-Hsien, Chen, Jen-Shiang

“… This paper describes the development of mixed binary integer programming (BIP) formulations for the reentrant job shop scheduling problem …”
Volltext

Joint versus separate spectrum sensing and resource allocation in OFDMA-based cognitive radio networks von Janatian, Nafiseh, Modarres-Hashemi, Mahmood, Sun, Sumei

“… ’ quality of service and detection probability of the primary user. This is a mixed binary integer programming problem which is NP …”
Volltext

A genetic algorithm for the simultaneous delivery and pickup problems with time window von Wang, Hsiao-Fan, Chen, Ying-Yen

“… ). A mixed binary integer programming model was developed for the problem and was validated …”
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

Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems von Jankovic, Olivera, Miskovic, Stefan, Stanimirovic, Zorica, Todosijevic, Raca

“… (USApHMCP and UMApHMCP) with binary and partial covering criteria. We present new mixed-integer programming formulations of the considered problems, which are valid for both binary and partial coverage cases …”
Volltext

Optimizing blocking flow shop scheduling problem with total completion time criterion von Moslehi, Ghasem, Khorasanian, Danial

“… We present two mixed binary integer programming models, one of which is based on the departure times of jobs from machines, and the other is based on the idle and blocking times of jobs …”
Volltext

A coevolutionary algorithm for the flexible delivery and pickup problem with time windows von Wang, Hsiao-Fan, Chen, Ying-Yen

“… This paper addresses a flexible delivery and pickup problem with time windows (FDPPTW) and formulates the problem into a mixed binary integer programming model …”
Volltext

Minimizing total flow time on a batch processing machine using a hybrid max–min ant system von Rafiee Parsa, N., Karimi, B., Moattar Husseini, S.M.

“… The problem is formulated as a binary mixed integer programming model. Since the research problem is shown to be NP-hard, a hybrid metaheuristic algorithm based on the max–min ant system (MMAS) is proposed …”
Volltext

Minimizing the computation latency of FDMA‐based wireless powered edge computing network von Chen, Xi, Jiang, Guodong, Chi, Kaikai, Zhang, Shubin, Wei, Xinchen, Chen, Gang

“… The 0–1 mixed integer programming problem of binary offloading on wireless powered mobile edge computing (WP‐MEC …”
Volltext

A comparative study of mixed-integer linear programming and genetic algorithms for solving binary problems von Kuendee, Punyisa, Janjarassuk, Udom

“… This paper aims to investigate the capability of mixed-integer linear programming (MILP …”
Volltext

Optimization models for the tool change scheduling problem von Chen, Jen-Shiang

“… In this paper, we examine this problem to minimize the total tardiness of jobs. Two mixed binary integer programming models are developed to optimally solve this problem …”
Volltext

Information-based branching schemes for binary linear mixed integer problems von Kılınç Karzan, Fatma, Nemhauser, George L., Savelsbergh, Martin W. P.

“… Branching variable selection can greatly affect the effectiveness and efficiency of a branch-and-bound algorithm. Traditional approaches to branching variable …”
Volltext

Binary cut-and-branch method for solving mixed integer programming problems von Mezentsev, Yurii

“… The report is dedicated to the description of the algorithm for one of the methods for solving mixed-integer linear programming problems, which is based on binary cuttings …”
Volltext

Scenario relaxation algorithm for finite scenario-based min–max regret and min–max relative regret robust optimization von Assavapokee, Tiravat, Realff, Matthew J., Ammons, Jane C., Hong, I-Hsuan

“… Most practical decision-making problems are compounded in difficulty by the degree of uncertainty and ambiguity surrounding the key model parameters …”
Volltext