Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
bounding procedures
Description:
Algorithmic steps for deriving bounds on feasible solutions, commonly used to improve optimization and scheduling methods.
Related topics:
Vehicle Routing Optimization Methods (17%),
Scheduling and Optimization Algorithms (15%),
Advanced Optimization Algorithms Research (9%),
Complexity and Algorithms in Graphs (9%)
OpenAlex ID:
keywords/bounding-procedures
A unified exact method for solving different classes of vehicle routing problems
2008
·
Roberto Baldacci
, Aristide Mingozzi
·
Mathematical Programming
·
309
Global Optimization with Non-Convex Constraints: Sequential and Parallel Algorithms
2013
·
Roman G. Strongin
, Yaroslav D. Sergeyev
·
298
An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
2004
·
Roberto Baldacci
, Vittorio Maniezzo
, et al.
·
Operations Research
·
286
A Multiparametric Programming Approach for Linear Process Engineering Problems under Uncertainty
1997
·
Joaquín Acevedo
, Efstratios N. Pistikopoulos
·
Industrial & Engineering Chemistry Research
·
174
Resource-Constrained Assignment Scheduling
1986
·
Joseph B. Mazzola
, Alan W. Neebe
·
Operations Research
·
108
A Set Partitioning Approach to the Crew Scheduling Problem
1999
·
A. Mingozzi
, M. A. Boschetti
, et al.
·
Operations Research
·
102
The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problem
2006
·
Roberto Baldacci
, Lawrence Bodin
, et al.
·
Computers & Operations Research
·
88
Solution of the zero-one multiple knapsack problem
1980
·
Silvano Martello
, Paolo Toth
·
European Journal of Operational Research
·
86
New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
2002
·
M. A. Boschetti
·
IMA Journal of Management Mathematics
·
85
Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows
2021
·
Ece Naz Duman
, Duygu Taş
, et al.
·
International Journal of Production Research
·
83
BiqCrunch: A Semidefinite Branch-and-Bound Method for Solving Binary Quadratic Problems
2017
·
Nathan Krislock
, Jérôme Malick
, et al.
·
ACM Transactions on Mathematical Software
·
80
PDF
Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
1994
·
Lucio Bianco
, Aristide Mingozzi
, et al.
·
INFOR Information Systems and Operational Research
·
66
Different behaviour of a double branch-and-bound algorithm on and problems
2005
·
Ramon Companys
, Manel Mateo
·
Computers & Operations Research
·
57
Global minimization of indefinite quadratic functions subject to box constraints
1993
·
Pierre Hansen
, Brigitte Jaumard
, et al.
·
Naval Research Logistics (NRL)
·
56
An Adaptive Large Neighborhood Search for relocating vehicles in electric carsharing services
2018
·
Maurizio Bruglieri
, Ferdinando Pezzella
, et al.
·
Discrete Applied Mathematics
·
54
On the global minimization of the value-at-risk
2004
·
Jong-shi Pang †
, Sven Leyffer
·
Optimization methods & software
·
54
PDF
Combining Clause Learning and Branch and Bound for MaxSAT
2021
·
Li, Chu-Min
, Xu, Zhenxing
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
52
PDF
On solving unreliable planar location problems
2001
·
Shine-Der Lee
·
Computers & Operations Research
·
49
A Branch and Bound Algorithm for the Multi Item Single Level Capacitated Dynamic Lotsizing Problem
1986
·
Ludo F. Gelders
, Johan Maes
, et al.
·
Lecture notes in economics and mathematical systems
·
49
A New Bound for Machine Scheduling
1976
·
Paul F. Bestwick
, N. A. J. Hastings
·
Journal of the Operational Research Society
·
43
A branch-and-bound approach to the job-shop scheduling problem
1973
·
SAID ASHOUR
, S. R. HIREMATH
·
International Journal of Production Research
·
42
Dynamic Programming for the Minimum Tour Duration Problem
2016
·
Christian Tilk
, Stefan Irnich
·
Transportation Science
·
41
PDF
Distributionally robust single machine scheduling with the total tardiness criterion
2018
·
Shengsheng Niu
, Shiji Song
, et al.
·
Computers & Operations Research
·
38
Boosting branch-and-bound MaxSAT solvers with clause learning
2021
·
Chu-Min Li
, Zhenxing Xu
, et al.
·
AI Communications
·
37
Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
2019
·
Hatim Djelassi
, Moll Glass
, et al.
·
Journal of Global Optimization
·
34
Show more works
View as search
Works count:
102
Citation count:
3,004
Year
Topic
Type