Управление и оптимизация
690 статей · 8 журналов
Журналы подкатегории (8)
- Computational Optimization and Applications · Springer Nature (228)
- Optimization and Engineering · Springer Nature (191)
- Optimization Letters · Springer Nature (180)
- Mathematics of Control, Signals, and Systems · Springer Nature (59)
- Journal of Economic Dynamics and Control · Elsevier (15)
- Optimal Control Applications and Methods · Wiley (15)
- EURO Journal on Computational Optimization · Elsevier (2)
- IET Networks · Wiley (0)
-
Exact and heuristic approaches for the integrated block relocation and fleet allocation problem with soft precedence constraints
Abstract We introduce the integrated block relocation and fleet allocation problem with soft precedence constraints, which jointly determines the unloading sequence of items and their assignment to a heterogeneous fleet of...
-
The cloven traveling salesman: cycle covers and the integrality gap of small ATSP instances
Abstract This work proposes a novel enumeration algorithm for computing the integrality gap of small instances of the subtour elimination formulation for the Asymmetric Traveling Salesman Problem ( atsp ). The core idea is to enumerate...
-
Homogeneous approximations and fixed-time semistability with applications to network consensus
Abstract This paper studies properties of homogeneous approximations in a geometric, coordinate-free setting. Specifically, we develop the concept of homogeneity in the 0-limit and $$\infty $$ ∞ -limit (i.e., homogeneity in the...
-
Generalized disjunctive programming for active produced water management
Abstract Active Produced Water Management (APWM) in oil and gas production aims to optimize produced water (PW) disposal operations to reduce environmental impacts while handling economic trade-offs. This paper proposes the design of an...
-
Optimal allocation of resources via optimal transport
Abstract In this work, we propose a Stackelberg-like model for a resource allocation problem over an urban region. The model incorporates transportation costs, distribution costs, and utility functions. A social planner aims to minimize...
-
On tackling non-linear charging functions in the electric vehicle routing problem
Abstract The increasing integration of electric vehicles into transportation fleets poses new challenges in the classical Vehicle Routing Problem, primarily due to the nonlinearity of the battery charging process. In the literature, the...
- A mixed integer quadratically constrained programming model for optimal deployment of capacitated fast-charging stations for electric vehicles: a Bayesian optimization approach
- An adaptive cubic regularisation algorithm based on interior-point methods for optimization with general inequality constraints
- Author Correction: On maximum-sum matchings of bichromatic points
- Aggregating reverse expert strategies considering extreme market situations for online portfolio selection
- Machine Learning and Optimization
- Disturbance-to-state stabilization by output feedback of nonlinear ODE cascaded with a reaction–diffusion equation
- Differentiating through a quadratic cone program
- Reachability of gradient descent
-
Pareto-optimal trees and Pareto forest: a bi-objective optimization model for binary classification
Abstract As inherently transparent models, classification trees play a central role in interpretable machine learning by providing easily traceable decision paths that allow users to understand how input features contribute to specific...
-
A relaxed primal–dual hybrid gradient method with line search
Abstract The primal–dual hybrid gradient method (PDHG) is a versatile optimization method commonly used for large optimization problems, including image reconstruction. With standard PDHG, there are three user-set parameters and...
-
The age-structured chemostat with substrate dynamics as a control system
Abstract In this work, we study an age-structured chemostat model with a renewal boundary condition and a coupled substrate equation. The model is nonlinear and consists of a hyperbolic partial differential equation and an ordinary...
- An improved adaptive general variable neighborhood search algorithm for the integrated production scheduling and vehicle routing problem with order acceptance
- A novel adaptive exploration method for parallel optimization
- A new adaptive algorithm for competitive group testing
-
Forward–backward splitting in bilaterally bounded Alexandrov spaces
Abstract With the goal of solving optimisation problems on non-Riemannian manifolds, such as geometrical surfaces with sharp edges, we develop and prove the convergence of a forward–backward method in Alexandrov spaces with curvature...
- A branch-and-price method for parallel machine scheduling with stochastic processing times
- An SAA approach for solving a class of stochastic linear semidefinite inverse optimal value problems
- An efficient linearization approach for project portfolio selection problems considering project interdependencies
-
Revisiting implicit variables in mathematical optimization: simplified modeling and a numerical evidence
Abstract Implicit variables of an optimization problem are used to model variationally challenging feasibility conditions in a tractable way while not entering the objective function. Hence, it is a standard approach to treat implicit...
-
Efficient warm-start strategies for Nash-based linear complementarity problems via bilinear approximation
Abstract We present an effective warm-starting scheme for solving large linear complementarity problems (LCPs) arising from Nash equilibrium problems. The approach generates high-quality starting points that, when passed to the solver,...
- Stability for set optimization problems and applications
- A relaxed scalable modulus-based matrix splitting method for vertical nonlinear complementarity problems
-
Learning to locate p-hubs in situations of changes in flow
Abstract The p -hub median problem is central to location science, with multiple applications in network design. Given a set of nodes, each of them sends and receives some flow to and from the other nodes. Among these nodes, p have to...
- Constraint hypergraph partitioning problems via recursive bipartition algorithm based on improved Dai–Kou conjugate gradient algorithm