Дискретная математика и комбинаторика
46 статей · 1 журналов
Журналы подкатегории (1)
- TOP · Springer Nature (46)
-
On how the rules that extend the concede-and-divide principle differ for pairs of claimants
Abstract In the context of conflicting claims problems, the Talmud, adjusted proportional, random arrival, minimal overlap, and average-of-awards rules are well-known extensions of the two-claimant concede-and-divide rule to larger...
- Restructuring evaluation using generalized inverse DEA-R frameworks
- Efficient global estimation of conditional-value-at-risk through stochastic kriging and extreme value theory
- Reliability modeling of three-state $$(k,\ell )$$-out-of-n systems subject to Marshall–Olkin shocks
- Semicontinuity conditions for set-valued equilibrium problems and applications to set optimization problems
- Iterated local search, iterated greedy and applications
- Guest editorial to the special issue on metaheuristics in TOP
- Tabu search: an application to the minimum dominating set problem
-
GRASP: an application to efficiently plan the low carbon emission distributed additive manufacturing
Abstract GRASP is a well-established metaheuristic algorithm that efficiently designs optimized solutions for complex problems. It has achieved notable results in scientific literature, particularly when addressing scenarios with many...
-
Heuristics for the weighted total domination problem
Abstract The weighted total domination problem (WTDP) belongs to the family of dominating set problems. Given an edge- and vertex- weighted graph, the WTDP consists in selecting a total dominating set D , such that the sum of vertices...
-
Harnessing memetic algorithms: a practical guide
Abstract The aim of this work is to provide a didactic approximation to memetic algorithms (MAs) and how to apply these techniques to an optimization problem. MAs are based on the synergistic combination of ideas from population-based...
-
A novel framework to construct quality indicators using the linear assignment problem
Abstract In multi-objective optimization problems (MOPs), we aim to simultaneously find the maximum or minimum values of two or more (often conflicting) objective functions. MOPs are often found in real-world applications and,...
- Trade-off optimization of a location-routing problem involving open routes and flexible fleet: a case study in Guadalajara, Mexico
-
Profit allocation in agricultural supply chains: exploring the nexus of cooperation and compensation
Abstract In this paper, we focus on decentralized agricultural supply chains consisting of multiple non-competing distributors satisfying the demand of their respective markets. These distributors source a single product from a farmer...
- Neural benders decomposition for mixed-integer programming
-
Construct, merge, solve and adapt
Abstract The CMSA algorithm for combinatorial optimization is a hybrid technique based on repeatedly solving sub-instances to the original problem instance. The incumbent sub-instance is extended at each iteration by the probabilistic...