Results 251 to 260 of about 204,066 (330)
Some of the next articles are maybe not open access.
Sparse regression at scale: branch-and-bound rooted in first-order optimization
Mathematical programming, 2020We consider the least squares regression problem, penalized with a combination of the ℓ0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs ...
Hussein Hazimeh, R. Mazumder, A. Saab
semanticscholar +1 more source
Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
Mathematical programmingMixed Integer Linear Programming (MILP) is a pillar of mathematical optimization that offers a powerful modeling language for a wide range of applications. The main engine for solving MILPs is the branch-and-bound algorithm.
Lara Scavuzzo +3 more
semanticscholar +1 more source
Neural Network Verification with Branch-and-Bound for General Nonlinearities
International Conference on Tools and Algorithms for Construction and Analysis of SystemsBranch-and-bound (BaB) is among the most effective techniques for neural network (NN) verification. However, existing works on BaB for NN verification have mostly focused on NNs with piecewise linear activations, especially ReLU networks.
Zhouxing Shi +5 more
semanticscholar +1 more source
A Branch and Bound Algorithm for Scheduling of Flexible Manufacturing Systems
IEEE Transactions on Automation Science and EngineeringFlexible manufacturing systems (FMSs), which can easily adapt to changes in job types, have been widely used in manufacturing areas. Scheduling of FMSs is a variant of a flexible job shop with transport robots and no buffer, and it is extremely hard as ...
Jeongsun Ahn, Hyun-Jung Kim
semanticscholar +1 more source
1990
A widely used method to solve various kinds of difficult optimization problems is called branch and bound. In this technique, the feasible set is relaxed and subsequently split into parts (branching) over which lower (and often also upper) bounds of the objective function value can be determined (bounding).
Reiner Horst, Hoang Tuy
openaire +1 more source
A widely used method to solve various kinds of difficult optimization problems is called branch and bound. In this technique, the feasible set is relaxed and subsequently split into parts (branching) over which lower (and often also upper) bounds of the objective function value can be determined (bounding).
Reiner Horst, Hoang Tuy
openaire +1 more source
2010
We now turn to the discussion of how to solve the linear ordering problem to (proven) optimality. In this chapter we start with the branch-and-bound method which is a general procedure for solving combinatorial optimization problems. In the subsequent chapters this approach will be realized in a special way leading to the so-called branch-and-cut ...
Rafael Martí, Gerhard Reinelt
openaire +1 more source
We now turn to the discussion of how to solve the linear ordering problem to (proven) optimality. In this chapter we start with the branch-and-bound method which is a general procedure for solving combinatorial optimization problems. In the subsequent chapters this approach will be realized in a special way leading to the so-called branch-and-cut ...
Rafael Martí, Gerhard Reinelt
openaire +1 more source
A simple unified branch-and-bound algorithm for minimum zone circularity and sphericity errors
Measurement science and technology, 2020This paper presents a simple branch-and-bound (B&B) algorithm to compute the minimum zone circularity/sphericity error, which is formulated as the problem of finding the centers of two concentric circles/spheres that contain given points between them and
Yu Zheng
semanticscholar +1 more source
2000
The purpose of this chapter is to introduce and illustrate the most popular and successful computational approach to integer programming problems today. Rather than being a specific algorithm, branch and bound is a general principle that allows the user to finetune the procedure and adjust it to the problem under consideration.
H. A. Eiselt, C.-L. Sandblom
openaire +1 more source
The purpose of this chapter is to introduce and illustrate the most popular and successful computational approach to integer programming problems today. Rather than being a specific algorithm, branch and bound is a general principle that allows the user to finetune the procedure and adjust it to the problem under consideration.
H. A. Eiselt, C.-L. Sandblom
openaire +1 more source
FAST DETERMINISTIC PARALLEL BRANCH-AND-BOUND
Parallel Processing Letters, 1999The branch-and-bound problem involves determining the minimum cost leaf in a cost-labelled tree, subject to the constraint that only the root is known initially and that children are revealed only by visiting thier parent. We present the first efficient deterministic algorithm to solve the branch-and-bound problem for a tree T of constant degree on a ...
HERLEY K. T. +2 more
openaire +2 more sources
A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
INFORMS journal on computing, 2019The Traveling Salesman Problem with a Drone (TSP-D) is a hybrid truck and drone model of delivery, in which the drone rides on the truck and launches from the truck to deliver packages.
Stefan Poikonen, B. Golden, E. Wasil
semanticscholar +1 more source