New formulations and branch-and-cut procedures for the longest induced path problem

Título:

New formulations and branch-and-cut procedures for the longest induced path problem

Autor:

Celso da Cruz Carneiro Ribeiro

Ano:

2022

DOI:

10.1016/j.cor.2021.105627

Revista:

Computers & Operations Research

ISSN:

03050548

Tags:

Combinatorial optimization

Integer programming

longest induced path

maximum induced subgraphs

maximum cardinality

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

A branch-and-cut algorithm for scheduling the highly-constrained Chilean soccer tournament

Optimal Routing for Multi-service Communication Networks

Constraint programming for the diameter constrained minimum spanning tree problem

Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations

Performance Evaluation of Vector Implementations of Combinatorial Algorithms

Exploring Load Balancing in Parallel Processing of Recursive Queries

A Linear Time Algorithm for the Computation of Some Distance Functions between Convex Polygons

Clustering and Clique Partitioning: Simulated Annealing and Tabu Search Approaches

Sports scheduling: Problems and applications

Improved solutions for the freight consolidation and containerization problem using aggregation and symmetry breaking