Results 1 to 10 of about 28,652 (150)
IEEE Access, 2021 The study focuses on the strategic decisions including on the location and capacity of stations and the fleet size for designing the one-way station-based carsharing systems. Under demand uncertainty, we introduce a two-stage risk-averse stochastic model
Kai Zhang +3 more
doaj +1 more source
Branch and price for submodular bin packing
EURO Journal on Computational Optimization, 2023 The Submodular Bin Packing (SMBP) problem asks for packing unsplittable items into a minimal number of bins for which the capacity utilization function is submodular.
Liding Xu +3 more
doaj +1 more source
Dynamic Three-Dimensional Surface Reconstruction Approach for Continuously Deformed Objects
IEEE Photonics Journal, 2021 For dynamic three-dimensional (3-D) surface reconstruction of continuously deformed objects, an efficient method employing one fringe pattern is proposed.
Jianhua Wang, Yanxi Yang, Yuguo Zhou
doaj +1 more source
Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment [PDF]
Компьютерные исследования и моделирование, 2015 The paper presents an implementation of branch and bound algorithm employing coarse grained parallelism. The system is based on CBC (COIN-OR branch and cut) open-source MIP solver and inter-process communication capabilities of Erlang.
S. A. Smirnov, V. V. Voloshinov
doaj +1 more source
A branch‐and‐cut algorithm for partition coloring [PDF]
Networks, 2009 AbstractLet G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1,…,Qq} is a partition of V into q subsets. We refer to Q1,…,Qq as the components of the partition. The partition coloring problem (PCP) consists of finding a subset V′ of V with exactly one vertex from each component Q1,…,Qq and such that ...
Frota, Yuri +3 more
openaire +1 more source
Mining, 2022 Open pit mine production scheduling is a computationally expensive large-scale mixed-integer linear programming problem. This research develops a computationally efficient algorithm to solve open pit production scheduling problems under uncertain ...
Devendra Joshi +3 more
doaj +1 more source
IEEE Access, 2022 The tourist trip design problem (TTDP) helps the trip planners, such as tourists, tour companies, and government agencies, automate their trip planning. TTDP solver chooses and sequences an optimal subset of point of interest (POIs), which adhere to the ...
Supoj Choachaicharoenkul +2 more
doaj +1 more source
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
IEEE Access, 2021 With the help of accurate parking navigation systems, sharing vacant private parking spaces with public travelers may have the potential of reducing the number of cruising vehicles and contribute to traffic emission reduction.
Pengfei Zhao +3 more
doaj +1 more source
EURO Journal on Computational Optimization, 2013 We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP.
Mounira Groiez +3 more
doaj +1 more source