graphs¶

Hospitals-Residents MIP¶

Notebooks > Hospitals-Residents MIP
    
Description: hospitals-residents problem with ties problem solved with ampl and highs
Tags: amplpy, assignment, mip, data-structures, graphs
Author: Marcos Dominguez Velad (23 notebooks) <marcos@ampl.com>

P-Median problem¶

Notebooks > P-Median problem
    
Description: this notebook states the p-median problem with a simple example, and a MIP formulation in amplpy. The problem is parametrized with a class, so it is easier to sample and replicate experiments. A graphical solution is plotted.
Tags: amplpy, mip, facility-location, bin-packing, graphs, highs
Author: Marcos Dominguez Velad (23 notebooks) <marcos@ampl.com>

Supply chain network¶

Notebooks > Supply chain network
    
Description: Compute optimal routes to connect suppliers/demanding nodes in a network. Routes have an associated fixed and variable cost. There are different products to ship. The problem is formulated as a MIP with binary variables. Python data structures are used to load the data into the model.
Tags: mixed-integer-linear, supply_chain, network, transportation, graphs
Author: Marcos Dominguez Velad (23 notebooks) <marcos@ampl.com>

Warehouse location and transport¶

Notebooks > Warehouse location and transport
    
Description: Model for warehouse allocation. Farms (suppliers) send feedstock to warehouses, and later on, those warehouses send it to a production plant. The problem involves modeling a storage facility location problem with a transportation component to the final plant.
Tags: facility-location, highs, mip, mixed-integer-linear, supply_chain, network, transportation, graphs, networkx, transportation, mp
Author: Marcos Dominguez Velad (23 notebooks) <marcos@ampl.com>

google-sheets

gui