Publications associées à Network Formulations of Mixed-Integer Programs

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

Network Formulations of Mixed-Integer Programs

Graph Chatbot

Chattez avec Graph Search

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Optimal Representations for Adaptive Streaming in Interactive Multiview Video Systems

Strengths and Limitations of Linear Programming Relaxations

On some algebraic and extremal problems in discrete geometry

Network Flow Integer Programming to Track Elliptical Cells in Time-Lapse Sequences

Introducing a preliminary Consists Selection in the Locomotive Assignment Problem

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Passenger Centric Train Timetabling Problem

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex

Methodology for Identification of Suitable ORC-Cycle and Working-Fluid using Integration with Multiple Objectives

Strengths and Limitations of Linear Programming Relaxations

On some algebraic and extremal problems in discrete geometry

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Network Flow Integer Programming to Track Elliptical Cells in Time-Lapse Sequences

Optimal Representations for Adaptive Streaming in Interactive Multiview Video Systems

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Methodology for Identification of Suitable ORC-Cycle and Working-Fluid using Integration with Multiple Objectives

Introducing a preliminary Consists Selection in the Locomotive Assignment Problem

Passenger Centric Train Timetabling Problem

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex