【摘 要】
：
We describe progress in linear and mixed-integer programming(MIP)algorithms and software over the last 25 years.As a result of this progress,modern linear p
【机 构】
：
National University of Singapore
论文部分内容阅读
We describe progress in linear and mixed-integer programming(MIP)algorithms and software over the last 25 years.As a result of this progress,modern linear programming(LP)codes are now capable of robustly and efficiently solving instances with multiple millions of variables and constraints.With these LP advances as a foundation,MIP then provides a mathematical framework that enables the representation and solution to provable optimality of a wide range of real-world planning and scheduling models,this in spite of the fact that MIP is NP-hard.Describing the remarkable performance improvements in MIP over the last 25 years and the mathematical underpinnings will central to this talk.
其他文献
In this talk,we are concerned with a focusing and defocusing complex short pulse equation(CSPE).Similar to the NLS equation,the focusing CSPE admits bright
We present two applications of polynomial systems in combinatorics.The first application comes from the problem of counting lattice walks restricted to the
Fliess operators play a central role in the theory of nonlinear control systems.They are combined in several ways through interconnections to represent syst
Evolutionary game theory on complex networks has been a hot topic in recent years and gotten lots of interest of scientist from many different fields,like e
Two types of polynomials,convex cover polynomials and split polynomials,are defined.A convex cover polynomial or a split polynomial can be decomposed into s
We review recent progress in reduction algorithms for integration,summation and creative Telescoping.These algorithms allow to determine integrability and s
In recent years,there have been major developments in applications of integrable systems.Originally,integrability has been recognized through solitons,which
Recently,polynomial optimization with semidefinite relaxations has been well studied.It applies Positivstellensatz and sums-of-squares technique to relax a
We provide a new hierarchy of semidefinite relaxations for polynomial optimization which combines some advantages of the standard LP-and SDP-relaxations:(a)
This paper,based on an invited talk at ICIAM 2015,describes an approach to high-dimensional integration,developed over the past 15 years,in which the numeri