В каталог

    Integer Programming

    16 курсов
    Operations Research
    Yong Wang

    Operations Research

    Decomposition Methods for the Unsplittable Flow Problem
    GERAD Research Center

    Decomposition Methods for the Unsplittable Flow Problem

    Personalized Shift Scheduling Problems: From Modelling to Efficient Resolution
    GERAD Research Center

    Personalized Shift Scheduling Problems: From Modelling to Efficient Resolution

    Design of Survivable Networks with Bounded-Length Paths
    GERAD Research Center

    Design of Survivable Networks with Bounded-Length Paths

    Dynamic Scheduling of E-Sports Tournaments
    GERAD Research Center

    Dynamic Scheduling of E-Sports Tournaments

    Daniel Dadush- Integer Programming and the Kannan-Lovasz Conjecture
    Hausdorff Center for Mathematics

    Daniel Dadush- Integer Programming and the Kannan-Lovasz Conjecture

    Sparse Integer Programming Is FPT
    Hausdorff Center for Mathematics

    Sparse Integer Programming Is FPT

    Gomory Mixed Integer Cuts Are Optimal
    Hausdorff Center for Mathematics

    Gomory Mixed Integer Cuts Are Optimal

    Some Approaches for Solving the Discretely-Constrained Mixed Complementarity Problem (DC-MCP)
    GERAD Research Center

    Some Approaches for Solving the Discretely-Constrained Mixed Complementarity Problem (DC-MCP)

    Fair and Interpretable Decision Rules for Binary Classification
    Institute for Pure & Applied Mathematics (IPAM)

    Fair and Interpretable Decision Rules for Binary Classification

    Computational Complexity in Theory and in Practice by Richard M. Karp
    International Centre for Theoretical Sciences

    Computational Complexity in Theory and in Practice by Richard M. Karp

    Design in Type I, Run in Type III - Fast and Scalable Bilinear Type Conversion Using Integer Programm
    TheIACR

    Design in Type I, Run in Type III - Fast and Scalable Bilinear Type Conversion Using Integer Programm

    From Algorithms to Agendas - A Beginner's Guide to Integer Programming
    EuroPython Conference

    From Algorithms to Agendas - A Beginner's Guide to Integer Programming

    Heaviside Composite Optimization and Complementarity Constraints by Progressive Integer Programming
    Erwin Schrödinger International Institute for Mathematics and Physics (ESI)

    Heaviside Composite Optimization and Complementarity Constraints by Progressive Integer Programming

    A Reverse Minkowski Theorem in Lattice Theory and Geometry
    Hausdorff Center for Mathematics

    A Reverse Minkowski Theorem in Lattice Theory and Geometry

    DLSS 5 - Нейрослоп или революция? | Стрим, общение
    VideoSmile

    DLSS 5 - Нейрослоп или революция? | Стрим, общение