Apontamentos de Gestão
Sebenta CGI 2011_2012
Início Das Coisas Nascem As Coisas)
Multistars and directed flow formulations
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
Preface
Editorial
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints
A classification of formulations for the (time-dependent) traveling salesman problem
A result on projection for the vehicle routing ptoblem
Multicommodity flow models for spanning trees with hop constraints
On the Vehicle Routing Problem with lower bound capacities
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
On the capacitated concentrator location problem: a reformulation by discretization
The multi-weighted Steiner tree problem: A reformulation by intersection
Lower bounds for the mixed capacitated arc routing problem
Models for a traveling purchaser problem with additional side-constraints
Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations
