Matemáticas
Network Design
100%
Costs
41%
Branch-and-cut
39%
Integer Program
35%
Traffic
33%
Branch-and-price
32%
Hierarchical Networks
31%
Linear Program
30%
Customers
30%
Lagrangean Relaxation
30%
Time Windows
28%
Vehicle Routing Problem
27%
Travel Time
27%
Cable
25%
Cutting Planes
25%
Demand
24%
Vertex of a graph
21%
Travelling salesman problems
21%
Optimization
20%
Heuristics
17%
Pickup and Delivery
16%
Branch-and-bound
15%
Equity
14%
Line
13%
Alternatives
12%
Model
12%
Programming Model
11%
Alignment
11%
Planning
10%
Undirected Graph
9%
Maximise
9%
Path
9%
Angle
8%
Binary Variables
8%
Configuration
7%
Methodology
7%
Strategy
7%
Multicommodity Flow
6%
Lower bound
6%
Modeling
6%
Mixed Integer Programming
6%
Formulation
6%
Design
6%
Framework
5%
Routing
5%
Integer Programming
5%
Weighted Sums
5%
Decision Making
5%
Economía y empresa
Network Design
93%
Chile
43%
Linear Program
34%
Lagrangean Relaxation
30%
Branch-and-price
29%
Integer
29%
Cutting Planes
29%
Costs
28%
Traveling Salesman Problem
26%
Node
25%
Vehicle Routing Problem
24%
Time Windows
23%
Cable
23%
Destination
23%
Travel Time
22%
Transportation Costs
21%
Heuristics
18%
Graph
17%
Branch-and-bound
16%
Pickup and Delivery
14%
Travel Cost
12%
Equity
11%
Freight
10%
Lower Bounds
9%
Alternatives
9%
Alignment
8%
Modeling
8%
Ad Hoc
6%
Planning
6%
Routing
5%
Revenue
5%
Methodology
5%
Ingeniería y ciencia de los materiales
Rapid transit
52%
Inventory control
51%
Vehicle routing
46%
Costs
42%
Warehouses
30%
Relaxation
27%
Docks
26%
Traveling salesman problem
23%
Travel time
20%
Supply chains
19%
Cables
16%
Decomposition
9%
Integer programming
8%
Industry
8%
Health
8%
Subways
7%
Decision making
7%
Optical fibers
6%
Planning
6%
Nonlinear programming
5%
