Výsledky vyhledávání - programming: integer algorithm branch and (bound OR sound)

An enhanced branch-and-bound algorithm for bilevel integer linear programming Autor Liu, Shaonan, Wang, Mingzheng, Kong, Nan, Hu, Xiangpei

“…•An enhanced branch-and-bound algorithm for a class of bilevel integer linear programming (BILP) problems…”
Získat plný text

Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs Autor Forget, Nicolas, Gadegaard, Sune Lauth, Nielsen, Lars Relund

“…•Reports extensive computational results. In this paper we propose a generic branch-and-bound algorithm for solving multi-objective integer linear programming problems…”
Získat plný text

Topology optimization via sequential integer programming and Canonical relaxation algorithm Autor Liang, Yuan, Cheng, Gengdong

“…The mathematical essence of structural topology optimization is large-scale nonlinear integer programming…”
Získat plný text

Multi-baseline phase unwrapping with robust branch and bound pure integer programming algorithm Autor Liu, Hui, Yue, JiaWei, Liu, WenKai, Huang, QiHuan, Li, GeShuang, Liu, Min

“…•A new robust branch and bound pure integer programming phase unwrapping (BB-PIP-PU) algorithm for multi-baseline InSAR based on operations research is proposed…”
Získat plný text

Homotopy continuation enhanced branch and bound algorithms for strongly nonconvex mixed‐integer nonlinear optimization Autor Ma, Yingjie, Li, Jie

“… In this study, we propose two robust homotopy continuation enhanced branch and bound (HCBB) algorithms (denoted as HCBB‐FP and HCBB‐RB) where the homotopy continuation…”
Získat plný text

A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs Autor Stidsen, Thomas, Andersen, Kim Allan, Dammann, Bernd

“… The resulting class of problems is named multiobjective mixed integer programming (MOMIP) problems. Solving these kinds of optimization problems exactly requires a method that can generate the whole set of nondominated points…”
Získat plný text

A Branch-and-Bound Algorithm for a Class of Mixed Integer Linear Maximum Multiplicative Programs: A Bi-objective Optimization Approach Autor Ghasemi Saghand, Payman, Charkhgard, Hadi, Kwon, Changhyun

“…•We show that the proposed algorithm outperforms a standard solver. We present a linear programming based branch-and-bound algorithm for a class of mixed integer optimization problems with a bi-linear objective function and linear constraints…”
Získat plný text

A new branch-and-bound algorithm for generalized affine multiplicative programming Autor Deng, Yaping, Shen, Peiping

“… Utilizing a piecewise linear technique, we then develop a mixed-integer linear programming (MILP…”
Získat plný text

Solving the Lexicographic Multi-Objective Mixed-Integer Linear Programming Problem using branch-and-bound and grossone methodology Autor Cococcioni, Marco, Cudazzo, Alessandro, Pappalardo, Massimo, Sergeyev, Yaroslav D.

“…•Lexicographic Multi-Objective Mixed Integer Linear Programming problem (LMILP) is studied.•The Grossone methodology using numerical infinities and infinitesimals is applied to LMILP…”
Získat plný text

A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems Autor Jaber, A., Lafon, P., Younes, R.

“… Others have suggested using heuristics with Multi-Criteria Branch and Bound (MCBB). A general hybrid approach is proposed based on MCBB and Non-dominated Sorting Genetic Algorithm 2 (NSGAII…”
Získat plný text

A branch-and-cut algorithm for the vehicle routing problem with drones Autor Tamke, Felix, Buscher, Udo

“…•We introduce a relaxation that provides good lower bounds and approximated objective function values at reduced run times…”
Získat plný text

A branch & bound algorithm for cutting and packing irregularly shaped pieces Autor Alvarez-Valdes, R., Martinez, A., Tamarit, J.M.

“… In this paper we make a systematic study of the problem and develop an exact Branch & Bound Algorithm. The initial existing mixed integer formulations are reviewed, tested and used as a starting point to develop a new and more efficient formulation…”
Získat plný text

A Branch and Bound Algorithm for Transmission Network Expansion Planning Using Nonconvex Mixed-Integer Nonlinear Programming Models Autor Zoppei, Reinaldo T., Delgado, Marcos A. J., Macedo, Leonardo H., Rider, Marcos J., Romero, Ruben

“…The branch and bound (BB) algorithm is widely used to obtain the global solution of mixed-integer linear programming (MILP) problems…”
Získat plný text

Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning Autor Morrison, David R., Jacobson, Sheldon H., Sauppe, Jason J., Sewell, Edward C.

“…The branch-and-bound (B&B) algorithmic framework has been used successfully to find exact solutions for a wide array of optimization problems…”
Získat plný text

Parallel branch and bound algorithm for solving integer linear programming models derived from behavioral synthesis Autor Fallah, Mohammad K, Fazlali, Mahmood

“… In this paper, we address this challenge by developing two exact parallel branch and bound algorithms which are capable of solving large-scale ILP models derived from behavioral synthesis…”
Získat plný text

A Branch-and-Bound Algorithm for non-Integer Linear Programs with Fuzzy Right-Hand Side Coefficients Autor Elaibi, Waleed Mohammed, Rahi, AbdulRahim Khalaf, Majeed, Rajaa Kamil, Alhasan, Asmaa Adnan

“…One algorithm design paradigm that makes it possible to use the spatial features of problems to prone the state space is Branch and Bound (B&B…”
Získat plný text

Integrated job-shop scheduling in an FMS with heterogeneous transporters: MILP formulation, constraint programming, and branch-and-bound Autor Ahmadi-Javid, Amir, Haghi, Maryam, Hooshangi-Tabrizi, Pedram

“… The problem is modelled using mixed-integer linear programming and constraint programming. Different structure-based branch-and-bound algorithms with two lower-bounding strategies are also developed…”
Získat plný text

Integer Linear Programming Model for Profit Maximization using Branch and Bound Algorithm in Retail Companies: Case of a Peruvian Company Autor Chancahuana Castillo, John Diego, Parisuaña Yucra, Willy Noe, Soto, Mario Ninaquispe, Ynfantes, Sonia Castro

“…) using linear programming techniques and the Branch and Bound algorithm. To introduce this paper we refute, through a review of previous studies in the same field, the use of this approach for its effectiveness in business decision-making…”
Získat plný text

An Improved Spatial Branch-and-Bound Algorithm for Non-Convex Optimal Electricity-Gas Flow Autor Liu, Pengxiang, Wu, Zhi, Gu, Wei, Lu, Yuping

“… In this paper, an improved spatial branch-and-bound algorithm is proposed to solve the non-convex problem, which is formulated as a mixed-integer bilinear programming, for its exact solution…”
Získat plný text

Mixed-integer programming model and branch-and-price-and-cut algorithm for urban bus network design and timetabling Autor Chu, James C.

“… An innovative mixed-integer programming (MIP) model is formulated and a parallel branch-and-price-and-cut (BPC…”
Získat plný text