scholarly journals Solving Robust Variants of the Maximum Weighted Independent Set Problem on Trees

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 285
Author(s):  
Ana Klobučar ◽  
Robert Manger
Keyword(s):  
Independent Set ◽  
General Purpose ◽  
Np Hard ◽  
High Quality ◽  
Independent Set Problem ◽  
Optimization Software

This paper deals with the maximum weighted independent set (MWIS) problem. We consider several robust variants of the MWIS problem on trees and prove that most of them are NP-hard. We propose a heuristic for solving the considered robust MWIS variants, which is customized for trees. We demonstrate by experiments that our algorithm produces high-quality solutions and runs much faster than a general-purpose optimization software.

A constrained independent set problem for matroids

2004 ◽  
Vol 32 (1) ◽  
pp. 23-26 ◽  
Author(s):  
Tamás Fleiner ◽  
András Frank ◽  
Satoru Iwata
Keyword(s):  
Independent Set ◽  
Independent Set Problem

A High-Quality and Fast Maximal Independent Set Implementation for GPUs

2019 ◽  
Vol 5 (2) ◽  
pp. 1-27
Author(s):  
Martin Burtscher ◽  
Sindhu Devale ◽  
Sahar Azimi ◽  
Jayadharini Jaiganesh ◽  
Evan Powers
Keyword(s):  
Independent Set ◽  
Maximal Independent Set ◽  
High Quality

A New Parallel Algorithm for the Maximal Independent Set Problem

1989 ◽  
Vol 18 (2) ◽  
pp. 419-427 ◽  
Author(s):  
Mark Goldberg ◽  
Thomas Spencer
Keyword(s):  
Parallel Algorithm ◽  
Independent Set ◽  
Maximal Independent Set ◽  
Independent Set Problem

scholarly journals Análisis comparativo de una metaheurística en base a algoritmo genético vs un método de ramificación y corte para un caso de entrega y recolección con restricciones de ventana de horario

2017 ◽  
Vol 1 (2) ◽  
Author(s):  
Fabian López
Keyword(s):  
Time Window ◽  
Time Frame ◽  
Branch And Cut ◽  
Pickup And Delivery ◽  
Np Hard ◽  
Practical Application ◽  
High Quality ◽  
Method Of Solution ◽  
Time Window Constraints ◽  
Computational Resources

Palabras claves: Algoritmos genéticos, logística de ruteo, metaheuristicas, secuenciaciónResumen. En la solución de problemas combinatorios, es importante evaluar el costo-beneficio entre la obtención de soluciones de alta calidad en detrimento de los recursos computacionales requeridos. El problema planteado es para el ruteo de un vehículo con entrega y recolección de producto y con restricciones de ventana de horario. En la práctica, dicho problema requiere ser atendido con instancias de gran escala (nodos ≥100). Existe un fuerte porcentaje de ventanas de horario activas (≥90%) y con factores de amplitud ≥75%. El problema es NP-hard y por tal motivo la aplicación de un método de solución exacta para resolverlo en la práctica, está limitado por el tiempo requerido para la actividad de ruteo. Se propone un algoritmo genético especializado, el cual ofrece soluciones de buena calidad (% de optimalidad aceptables) y en tiempos de ejecución computacional que hacen útil su aplicación en la práctica de la logística. Para comprobar la eficacia de la propuesta algorítmica se desarrolla un diseño experimental el cual hará uso de las soluciones óptimas obtenidas mediante un algoritmo de ramificación y corte sin límite de tiempo. Los resultados son favorables.Key words: Genetic algorithms, routing logistics, metaheuristics, schedulingAbstract. In an attempt to sovle the combinatorics problems, it is important to evaluate the costbenefit ratio between obtaining solutions of high quality and the loss of the computational resources required. The problem presented is for the routing of a vehicle with pickup and delivery of products with time window constraints. This problem requires instances of great scale (nodes≥100). A strong active time window percentage exists (≥90%) with factors of amplitude ≥75%. The problem is NP-hard and hence, the application of an exact method of solution, is limited by the time frame required for routing activity. A specialized genetic algorithm is proposed, which offers solutions of high precision and in computational times that makes its practical application useful. An experimental design is developed with good results that makes use of optimum solutions obtained by means of branch and cut algorithm without time limit.

scholarly journals New Instances for Maximum Weight Independent Set From a Vehicle Routing Application

2021 ◽  
Vol 2 (4) ◽  
Author(s):  
Yuanyuan Dong ◽  
Andrew V. Goldberg ◽  
Alexander Noe ◽  
Nikos Parotsidis ◽  
Mauricio G. C. Resende ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Independent Set ◽  
Maximum Weight ◽  
Routing Problem ◽  
Independent Set Problem ◽  
Maximum Weight Independent Set ◽  
Large Size

AbstractWe present a set of new instances of the maximum weight independent set problem. These instances are derived from a real-world vehicle routing problem and are challenging to solve in part because of their large size. We present instances with up to 881 thousand nodes and 383 million edges.

The Maximum Distance-d Independent Set Problem on Unit Disk Graphs

2018 ◽  
pp. 68-80
Author(s):  
Sangram K. Jena ◽  
Ramesh K. Jallu ◽  
Gautam K. Das ◽  
Subhas C. Nandy
Keyword(s):  
Unit Disk ◽  
Independent Set ◽  
Maximum Distance ◽  
Independent Set Problem ◽  
Unit Disk Graphs
Sign in / Sign up

Export Citation Format

Share Document