Search
Search Results
-
Complexity of the multiobjective minimum weight minimum stretch spanner problem
In this paper, we take an in-depth look at the complexity of a hitherto unexplored multiobjective minimum weight minimum stretch spanner problem; or...
-
Solving the minimum-cost double Roman domination problem
Double Roman domination (DRD) is a combinatorial optimization problem posed on undirected graphs. It can be interpreted as allocating certain service...
-
The Quadratic Minimum Spanning Tree Problem: Lower Bounds via Extended Formulations
The quadratic minimum spanning tree problem (QMSTP) is the problem of finding a spanning tree of a graph such that the total interaction cost between...
-
An update-and-stabilize framework for the minimum-norm-point problem
We consider the minimum-norm-point (MNP) problem over polyhedra, a well-studied problem that encompasses linear programming. We present a general...
-
Revisiting the Minimum Constraint Removal Problem in Mobile Robotics
The minimum constraint removal problem seeks to find the minimum number of constraints, i.e., obstacles, that need to be removed to connect a start...
-
An evolutionary game algorithm for minimum weighted vertex cover problem
The minimum weighted vertex cover (MWVC) problem is to find a subset of vertices that can cover all the edges of the network and minimize the sum of...
-
Community-based zigzag piloting algorithm for the strong generalized minimum label spanning tree problem
The strong generalized minimum label spanning tree problem (SGMLSTP) is to search the minimum label spanning tree (MLST) from an edge-labeled graph...
-
Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm
The electronic computer possesses powerful computing capabilities, but it is still limited by Moore’s law. Quantum computers are thus found capable...
-
Running minimum in the best-choice problem
The full-information best choice problem asks one to find a strategy maximising the probability of stop** at the minimum (or maximum) of a sequence
... 
-
-
Uncertain 4D-transportation problem with maximum profit and minimum carbon emission
The impact of transportation on greenhouse gas emissions is significant. Effective transportation planning can help in achieving maximum profit and...
-
The forward–backward splitting method for finding the minimum like-norm solution of the mixed variational inequality problem
We consider a general class of convex optimization problems in which one seeks to minimize a strongly convex function over a closed and convex set,...
-
-
-
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters
The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity in a given undirected graph. The problem...
-
An improved master-apprentice evolutionary algorithm for minimum independent dominating set problem
The minimum independent dominance set (MIDS) problem is an important version of the dominating set with some other applications. In this work, we...
-
An Iterated Local Search for the Minimum Edge-Dilation K-Center Problem
This paper studies the minimum edge-dilation K -center (MEDKC) problem for edge-weighted, undirected and connected graphs. This problem finds an...
-
A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithm
The minimum vertex-cover problem (MVCP) is an NP-complete optimization problem widely used in areas such as graph theory, social network, security...
-
Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
The minimum sum-of-squares clustering problem is a very important problem in data mining and machine learning with very many applications in, e.g.,...
-
A frequency and two-hop configuration checking-driven local search algorithm for the minimum weakly connected dominating set problem
The minimum weakly connected dominating set problem is a typical NP-hard problem with a wide range of applications. To solve this problem, we propose...
