Results 21 to 30 of about 140,088 (167)
Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines
Mathematics, 2021 We consider the problem of scheduling n jobs with identical processing times and given release as well as delivery times on m uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job.
Nodari Vakhania, Frank Werner
doaj +1 more source
An exact algorithm for design of content delivery networks in MPLS environment
Journal of Telecommunications and Information Technology, 2004 Content delivery network (CDN) is an efficient and inexpensive method to improve Internet service quality. In this paper we formulate an optimisation problem of replica location in a CDN using MPLS techniques.
Krzysztof Walkowiak
doaj +1 more source
A branch-and-cut algorithm for the target visitation problem
EURO Journal on Computational Optimization, 2019 In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base ...
Achim Hildenbrandt
doaj +1 more source
Improved Sample Complexity Bounds for Branch-and-Cut
, 2021 Branch-and-cut is the most widely used algorithm for solving integer programs, employed by commercial solvers like CPLEX and Gurobi. Branch-and-cut has a wide variety of tunable parameters that have a huge impact on the size of the search tree that it builds, but are challenging to tune by hand.
Balcan, Maria-Florina +3 more
openaire +4 more sources
Journal of High Energy Physics, 2023 We investigate the single off-shell scalar box integral with massless internal lines in dimensional regularization. A special emphasis is given to higher orders in the dimensional regularization parameter epsilon, its branch cut structure, and kinematic ...
Juliane Haug, Fabian Wunder
doaj +1 more source
The Independence Number Conditions for 2-Factors of a Claw-Free Graph
Axioms, 2022 In 2014, some scholars showed that every 2-connected claw-free graph G with independence number α(G)≤3 is Hamiltonian with one exception of family of graphs.
Wanpeng Lei, Liming Xiong, Jun Yin
doaj +1 more source
Fluids, 2019 A long overdue distinction between so-called variant and invariant complex potentials is proposed here for the first time. Invariant complex potentials describe physical flows where a switch of the real and imaginary parts of the function will still ...
Aadi Khanal, Ruud Weijermars
doaj +1 more source
A Branch-and-Cut algorithm for graph coloring
Discrete Applied Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Méndez-Díaz, I., Zabala, P.
openaire +4 more sources
Efficient Semidefinite Branch-and-Cut for MAP-MRF Inference [PDF]
International Journal of Computer Vision, 2015 We propose a Branch-and-Cut (B&C) method for solving general MAP-MRF inference problems. The core of our method is a very efficient bounding procedure, which combines scalable semidefinite programming (SDP) and a cutting-plane method for seeking violated constraints.
Wang, P. +3 more
openaire +3 more sources
A Branch-and-Cut Algorithm for Submodular Interdiction Games
INFORMS Journal on Computing, 2022 Many relevant applications from diverse areas such as marketing, wildlife conservation, and defending critical infrastructure can be modeled as interdiction games. In this work, we introduce interdiction games whose objective is a monotone and submodular set function.
Kübra Tanınmış, Markus Sinnl
openaire +2 more sources