Tire Noise Optimization Problem: a Mixed Integer Linear Program Approach

09/05/2018

∙

We present a Mixed Integer Linear Program (MILP) approach in order to model the nonlinear problem of minimizing the tire noise. We first take more industrial constraints into account than in a former work of the authors. Then, we associate a Branch-and-Cut algorithm to the MILP to obtain exact solutions. We compare our experimental results with those obtained by other methods.

READ FULL TEXT

Tire Noise Optimization Problem: a Mixed Integer Linear Program Approach

Neural Networks for Encoding Dynamic Security-Constrained Optimal Power Flow to Mixed-Integer Linear Programs

Convex integer optimization with Frank-Wolfe methods

Maximum a-Posteriori Estimation for the Gaussian Mixture Model via Mixed Integer Nonlinear Programming

Joint Antenna Selection and Phase-Only Beamforming Using Mixed-Integer Nonlinear Programming

When Lift-and-Project Cuts are Different

A Mixed Integer Linear Program For Human And Material Resources Optimization In Emergency Department

Embedding Delay-Constrained VNF Forwarding Graphs into Reconfigurable WDM Optical Networks – Extended Version

Tire Noise Optimization Problem: a Mixed Integer Linear Program Approach

Related Research

Neural Networks for Encoding Dynamic Security-Constrained Optimal Power Flow to Mixed-Integer Linear Programs

Convex integer optimization with Frank-Wolfe methods

Maximum a-Posteriori Estimation for the Gaussian Mixture Model via Mixed Integer Nonlinear Programming

Joint Antenna Selection and Phase-Only Beamforming Using Mixed-Integer Nonlinear Programming

When Lift-and-Project Cuts are Different

A Mixed Integer Linear Program For Human And Material Resources Optimization In Emergency Department

Embedding Delay-Constrained VNF Forwarding Graphs into Reconfigurable WDM Optical Networks – Extended Version