Pular para o conteúdo principal
  • Portal do Governo Brasileiro
  • Atualize sua Barra de Governo
Início
Buscar: Pesquisador(a) | Publicação
Portuguese Chinese (Simplified) English French German Korean Russian Spanish Swahili Yoruba

Menu principal

  • PESQUISADORES
  • REVISTAS
  • ASSUNTOS
  • PUBLICAÇÕES
Início An exact approach for the r-interdiction covering problem with fortification

An exact approach for the r-interdiction covering problem with fortification

Título: 
An exact approach for the r-interdiction covering problem with fortification
Autor: 
Artur Alves Pessoa
Ano: 
2019
DOI: 
10.1007/s10100-017-0494-7
Revista: 
Central European Journal of Operations Research
ISSN: 
1435246X
Idioma: 
Inglês
Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing
A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty
LEVEL OF REPAIR ANALYSIS INCLUDING FAILURE ANALYSIS AND OPTIMAL LOCATION OF MAINTENANCE FACILITIES AND RESOURCES
Solving Bin Packing Problems Using VRPSolver Models
A generic exact solver for vehicle routing and related problems
An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
Iterated local search for single machine total weighted tardiness batch scheduling
An exact approach for the r-interdiction median problem with fortification
Robust scheduling with budgeted uncertainty
  •  
  • 1 de 5
  • próximo ›

Sobre o site | Fale conosco

Versão Alpha. As informações contidas neste site foram importadas do Lattes no dia 20/04/2022.