Near Optimal Solutions for the Generalized Max-Controlled Set Problem

Título:

Near Optimal Solutions for the Generalized Max-Controlled Set Problem

Autor:

Carlos Alberto de Jesus Martinhon

Ano:

2010

DOI:

10.1016/j.cor.2010.01.012

Revista:

Computers & Operations Research

ISSN:

03050548

Tags:

Sandwich graph problems

Approximation algorithms

Linear Programming

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

Complexity of trails, paths and circuits in arc-colored digraphs

The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles

A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow

Paths and trails in edge-colored graphs

Ranking using η-efficiency and relative size measures based on DEA

Partition into cliques for cubic graphs: planar case, complexity and an approximation algorithm

Uma metaheurística GRASP/VNS para uma solução aproximada do Problema de Recobrimento de Rotas

Maximum colored trees in edge-colored graphs

Randomized generation of acyclic orientations upon anonymous distributed systems

Stronger K-tree relaxations for the vehicle routing problem