Jean B. Lasserre

SIAM J. Appl. Algebra Geom., December, 2023

A hierarchy of spectral relaxations for polynomial optimization.

[BibT_eX]

[DOI]

Math. Program. Comput., December, 2023

A modified Christoffel function and its asymptotic properties.

[BibT_eX]

[DOI]

J. Approx. Theory, November, 2023

A Sparse Version of Reznick's Positivstellensatz.

[BibT_eX]

[DOI]

Math. Oper. Res., May, 2023

Stokes, Gibbs, and Volume Computation of Semi-Algebraic Sets.

[BibT_eX]

[DOI]

Matteo Tacchi

Discret. Comput. Geom., 2023

Uncertainty Quantification of Set-Membership Estimation in Control and Perception: Revisiting the Minimum Enclosing Ellipsoid.

[BibT_eX]

[DOI]

Yukai Tang

Heng Yang

CoRR, 2023

Polynomial argmin for recovery and approximation of multivariate discontinuous functions.

[BibT_eX]

[DOI]

Milan Korda

CoRR, 2023

2022

CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., December, 2022

Exploiting Constant Trace Property in Large-scale Polynomial Optimization.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., December, 2022

Optimization on the Euclidean Unit Sphere.

[BibT_eX]

[DOI]

SIAM J. Optim., 2022

Homogeneous polynomials and spurious local minima on the unit sphere.

[BibT_eX]

[DOI]

Optim. Lett., 2022

Positivity certificates and polynomial optimization on non-compact semialgebraic sets.

[BibT_eX]

[DOI]

Math. Program., 2022

Nonnegative forms with sublevel sets of minimal volume.

[BibT_eX]

[DOI]

Khazhgali Kozhasov

Math. Program., 2022

Special Issue: Polynomial and Tensor Optimization.

[BibT_eX]

[DOI]

Shmuel Friedland

Lek-Heng Lim

Jiawang Nie

Math. Program., 2022

Exploiting Sparsity for Semi-Algebraic Set Volume Computation.

[BibT_eX]

[DOI]

Matteo Tacchi

Tillmann Weißer

Found. Comput. Math., 2022

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant.

[BibT_eX]

[DOI]

Kim-Chuan Toh

CoRR, 2022

A sublevel moment-SOS hierarchy for polynomial optimization.

[BibT_eX]

[DOI]

Tong Chen

Comput. Optim. Appl., 2022

2021

Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension.

[BibT_eX]

[DOI]

Jie Wang

SIAM J. Optim., 2021

TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity.

[BibT_eX]

[DOI]

Jie Wang

SIAM J. Optim., 2021

Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures.

[BibT_eX]

[DOI]

Swann Marx

Olivier Zahm

SIAM J. Optim., 2021

The moment-SOS hierarchy and the Christoffel-Darboux kernel.

[BibT_eX]

[DOI]

Optim. Lett., 2021

Dual optimal design and the Christoffel-Darboux polynomial.

[BibT_eX]

[DOI]

Yohann de Castro

Fabrice Gamboa

Optim. Lett., 2021

Distributionally robust polynomial chance-constraints under mixture ambiguity sets.

[BibT_eX]

[DOI]

Tillmann Weißer

Math. Program., 2021

Connecting optimization with spectral analysis of tri-diagonal matrices.

[BibT_eX]

[DOI]

Math. Program., 2021

Data Analysis from Empirical Moments and the Christoffel Function.

[BibT_eX]

[DOI]

Mihai Putinar

Found. Comput. Math., 2021

Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Piecewise-Linear Motion Planning amidst Static, Moving, or Morphing Obstacles.

[BibT_eX]

[DOI]

Bachir El Khadir

Vikas Sindhwani

Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Polynomial superlevel set approximation of swept-volume for computing collision probability in space encounters.

[BibT_eX]

[DOI]

Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

2020

Computing the Hausdorff Boundary Measure of Semialgebraic Sets.

[BibT_eX]

[DOI]

SIAM J. Appl. Algebra Geom., 2020

Polynomial Optimization for Bounding Lipschitz Constants of Deep Networks.

[BibT_eX]

[DOI]

Tong Chen

CoRR, 2020

Semialgebraic Optimization for Lipschitz Constants of ReLU Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

In SDP Relaxations, Inaccurate Solvers Do Robust Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

Volume of Sublevel Sets of Homogeneous Polynomials.

[BibT_eX]

[DOI]

SIAM J. Appl. Algebra Geom., 2019

Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets.

[BibT_eX]

[DOI]

Youssouf Emin

Math. Oper. Res., 2019

Approximating regions of attraction of a sparse polynomial differential system.

[BibT_eX]

[DOI]

CoRR, 2019

Simple formula for integration of polynomials on a simplex.

[BibT_eX]

[DOI]

CoRR, 2019

The empirical Christoffel function with applications in data analysis.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2019

Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?

[BibT_eX]

[DOI]

Cédric Josz

Bernard Mourrain

Adv. Comput. Math., 2019

On Moment Problems with Holonomic Functions.

[BibT_eX]

[DOI]

Florent Bréhard

Mioara Joldes

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Volume of sub-level sets of polynomials.

[BibT_eX]

[DOI]

Proceedings of the 17th European Control Conference, 2019

2018

Optimal Data Fitting: A Moment Approach.

[BibT_eX]

[DOI]

SIAM J. Optim., 2018

Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity.

[BibT_eX]

[DOI]

Tillmann Weißer

Kim-Chuan Toh

Math. Program. Comput., 2018

Determining projection constants of univariate polynomial spaces.

[BibT_eX]

[DOI]

Simon Foucart

J. Approx. Theory, 2018

2017

Positivity Certificates in Optimal Control.

[BibT_eX]

[DOI]

Proceedings of the Geometric and Numerical Foundations of Movements, 2017

Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Bound-Constrained Polynomial Optimization Using Only Elementary Calculations.

[BibT_eX]

[DOI]

Math. Oper. Res., 2017

A bounded degree SOS hierarchy for polynomial optimization.

[BibT_eX]

[DOI]

Kim-Chuan Toh

Shouguang Yang

EURO J. Comput. Optim., 2017

Representation of Chance-Constraints With Strong Asymptotic Guarantees.

[BibT_eX]

[DOI]

IEEE Control. Syst. Lett., 2017

The empirical Christoffel function in Statistics and Machine Learning.

[BibT_eX]

[DOI]

CoRR, 2017

Approximate Optimal Designs for Multivariate Polynomial Regression.

[BibT_eX]

[DOI]

CoRR, 2017

Computing Gaussian & exponential measures of semi-algebraic sets.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2017

On inverse optimal control via polynomial optimization.

[BibT_eX]

[DOI]

Jérémy Rouot

Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017

2016

Convex Optimization and Parsimony of Lp-balls Representation.

[BibT_eX]

[DOI]

SIAM J. Optim., 2016

Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems.

[BibT_eX]

[DOI]

Vaithilingam Jeyakumar

Guoyin Li

T. S. Pham

SIAM J. Optim., 2016

Linear Conic Optimization for Inverse Optimal Control.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2016

Semidefinite Approximations of the Polynomial Abscissa.

[BibT_eX]

[DOI]

Roxana Heß

Tien Son Pham

SIAM J. Control. Optim., 2016

A MAX-CUT formulation of 0/1 programs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2016

Minimizing the sum of many rational functions.

[BibT_eX]

[DOI]

Florian Bugarin

Math. Program. Comput., 2016

Lebesgue decomposition in action via semidefinite relaxations.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2016

Sorting out typicality with the inverse moment matrix SOS polynomial.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015

Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets.

[BibT_eX]

[DOI]

SIAM J. Optim., 2015

Volume of slices and sections of the simplex in closed form.

[BibT_eX]

[DOI]

Optim. Lett., 2015

The 2013 Newton Institute Programme on polynomial optimization.

[BibT_eX]

[DOI]

Math. Program., 2015

A generalization of Löwner-John's ellipsoid theorem.

[BibT_eX]

[DOI]

Math. Program., 2015

Tractable approximations of sets defined with quantifiers.

[BibT_eX]

[DOI]

Math. Program., 2015

Rank-Constrained Fundamental Matrix Estimation by Polynomial Global Optimization Versus the Eight-Point Algorithm.

[BibT_eX]

[DOI]

Florian Bugarin

Adrien Bartoli

Jean-José Orteu

Thierry Sentenac

J. Math. Imaging Vis., 2015

Level Sets and NonGaussian Integrals of Positively Homogeneous Functions.

[BibT_eX]

[DOI]

IGTR, 2015

Algebraic-exponential Data Recovery from Moments.

[BibT_eX]

[DOI]

Mihai Putinar

Discret. Comput. Geom., 2015

Optimization as motion selection principle in robot action.

[BibT_eX]

[DOI]

Jean-Paul Laumond

Nicolas Mansard

Commun. ACM, 2015

2014

Measures and LMIs for Impulsive Nonlinear Optimal Control.

[BibT_eX]

[DOI]

Mathieu Claeys

IEEE Trans. Autom. Control., 2014

A Unified Framework for Solving a General Class of Conditional and Robust Set-Membership Estimation Problems.

[BibT_eX]

[DOI]

Vito Cerone

Dario Piga

Diego Regruto

IEEE Trans. Autom. Control., 2014

Approximating Pareto curves using semidefinite relaxations.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

Erratum to: On convex optimization without convex representation.

[BibT_eX]

[DOI]

Optim. Lett., 2014

New approximations for the cone of copositive matrices and its dual.

[BibT_eX]

[DOI]

Math. Program., 2014

On Polynomial Optimization Over Non-compact Semi-algebraic Sets.

[BibT_eX]

[DOI]

Vaithilingam Jeyakumar

Guoyin Li

J. Optim. Theory Appl., 2014

Lower bounds on the global minimum of a polynomial.

[BibT_eX]

[DOI]

Mehdi Ghasemi

M. Marshall

Comput. Optim. Appl., 2014

Optimality in robot motion: optimal versus optimized motion.

[BibT_eX]

[DOI]

Jean-Paul Laumond

Nicolas Mansard

Commun. ACM, 2014

Inverse optimal control with polynomial optimization.

[BibT_eX]

[DOI]

Proceedings of the 53rd IEEE Conference on Decision and Control, 2014

2013

A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies.

[BibT_eX]

[DOI]

SIAM J. Optim., 2013

Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization.

[BibT_eX]

[DOI]

Math. Oper. Res., 2013

Inverse Polynomial Optimization.

[BibT_eX]

[DOI]

Math. Oper. Res., 2013

Moment matrices, border bases and real radical computation.

[BibT_eX]

[DOI]

J. Symb. Comput., 2013

Convex underestimators of polynomials.

[BibT_eX]

[DOI]

Tung Phan Thanh

J. Glob. Optim., 2013

Recovering an Homogeneous Polynomial from Moments of Its Level Set.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Moment LMI approach to LTV impulsive control.

[BibT_eX]

[DOI]

Mathieu Claeys

Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

2012

Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2012

Semidefinite programming for min-max problems and games.

[BibT_eX]

[DOI]

Rida Laraki

Math. Program., 2012

A "joint + marginal" heuristic for 0/1 programs.

[BibT_eX]

[DOI]

Tung Phan Thanh

J. Glob. Optim., 2012

The existence of Gaussian cubature formulas.

[BibT_eX]

[DOI]

J. Approx. Theory, 2012

The Inverse Moment Problem for Convex Polytopes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

Measures and LMI for impulsive optimal control with applications to space rendezvous problems.

[BibT_eX]

[DOI]

Mathieu Claeys

Proceedings of the American Control Conference, 2012

Modern Optimization Modelling Techniques.

[BibT_eX]

[DOI]

Roberto Cominetti

Francisco Facchinei

Advanced courses in mathematics : CRM Barcelona, Birkhäuser, ISBN: 978-3-0348-0290-1, 2012

2011

A New Look at Nonnegativity on Closed Sets and Polynomial Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2011

On convex optimization without convex representation.

[BibT_eX]

[DOI]

Optim. Lett., 2011

Min-max and robust polynomial optimization.

[BibT_eX]

[DOI]

J. Glob. Optim., 2011

2010

Positivity and Optimization for Semi-Algebraic Functions.

[BibT_eX]

[DOI]

Mihai Putinar

SIAM J. Optim., 2010

A "Joint+Marginal" Approach to Parametric Polynomial Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2010

On representations of the feasible set in convex optimization.

[BibT_eX]

[DOI]

Optim. Lett., 2010

Certificates of convexity for basic semi-algebraic sets.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2010

A "joint+marginal" algorithm for polynomial optimization.

[BibT_eX]

[DOI]

Tung Phan Thanh

Proceedings of the 49th IEEE Conference on Decision and Control, 2010

2009

A prolongation-projection algorithm for computing the finite real variety of an ideal.

[BibT_eX]

[DOI]

Monique Laurent

Philipp Rostalski

Theor. Comput. Sci., 2009

Approximate Volume and Integration for Basic Semialgebraic Sets.

[BibT_eX]

[DOI]

SIAM Rev., 2009

Convexity in SemiAlgebraic Geometry and Polynomial Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2009

GloptiPoly 3: moments, optimization and semidefinite programming.

[BibT_eX]

[DOI]

Johan Löfberg

Optim. Methods Softw., 2009

Convex sets with semidefinite representation.

[BibT_eX]

[DOI]

Math. Program., 2009

The K-moment problem with densities.

[BibT_eX]

[DOI]

Math. Program., 2009

Moments and sums of squares for polynomial optimization and related problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2009

Certificates and relaxations for integer programming and the semi-group membership problem

[BibT_eX]

[DOI]

CoRR, 2009

POCP: A package for polynomial optimal control problems.

[BibT_eX]

[DOI]

Proceedings of the 10th European Control Conference, 2009

Discrete-time stochastic optimal control via occupation measures and moment relaxations.

[BibT_eX]

[DOI]

Moritz Diehl

Proceedings of the 48th IEEE Conference on Decision and Control, 2009

2008

Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2008

Approximating integrals of multivariate exponentials: A moment approach.

[BibT_eX]

[DOI]

Dimitris Bertsimas

Xuan Vinh Doan

Oper. Res. Lett., 2008

A semidefinite programming approach to the generalized problem of moments.

[BibT_eX]

[DOI]

Math. Program., 2008

Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals.

[BibT_eX]

[DOI]

Monique Laurent

Philipp Rostalski

Found. Comput. Math., 2008

Semidefinite programming for N-Player Games

[BibT_eX]

[DOI]

Rida Laraki

CoRR, 2008

Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm.

[BibT_eX]

[DOI]

Monique Laurent

Philipp Rostalski

Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

Nonlinear optimal control synthesis via occupation measures.

[BibT_eX]

[DOI]

Proceedings of the 47th IEEE Conference on Decision and Control, 2008

2007

Simple Explicit Formula for Counting Lattice Points of Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Semidefinite programming for gradient and Hessian computation in maximum entropy estimation.

[BibT_eX]

[DOI]

Proceedings of the 46th IEEE Conference on Decision and Control, 2007

2006

Convergent relaxations of polynomial matrix inequalities and static output feedback.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2006

A Sum of Squares Approximation of Nonnegative Polynomials.

[BibT_eX]

[DOI]

SIAM J. Optim., 2006

Convergent SDP-Relaxations in Polynomial Optimization with Sparsity.

[BibT_eX]

[DOI]

SIAM J. Optim., 2006

LMIs for constrained polynomial interpolation with application in trajectory planning.

[BibT_eX]

[DOI]

Syst. Control. Lett., 2006

Robust global optimization with polynomials.

[BibT_eX]

[DOI]

Math. Program., 2006

2005

Polynomial Programming: LP-Relaxations Also Converge.

[BibT_eX]

[DOI]

SIAM J. Optim., 2005

Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set.

[BibT_eX]

[DOI]

SIAM J. Optim., 2005

An Alternative Algorithm for Counting Lattice Points in a Convex Polytope.

[BibT_eX]

[DOI]

Math. Oper. Res., 2005

Hierarchical scheduling for decision support.

[BibT_eX]

[DOI]

J. Intell. Manuf., 2005

Erratum to "Generating functions and duality for integer programs": [Discrete Optimization 1 (2) (2004) 167-187].

[BibT_eX]

[DOI]

Discret. Optim., 2005

Nonlinear optimal control: approximations via moments and LMI-relaxations.

[BibT_eX]

[DOI]

Christophe Prieur

Proceedings of the 44th IEEE IEEE Conference on Decision and Control and 8th European Control Conference Control, 2005

SOS approximation of polynomials nonnegative on an algebraic set.

[BibT_eX]

[DOI]

Proceedings of the 44th IEEE IEEE Conference on Decision and Control and 8th European Control Conference Control, 2005

2004

Characterizing polynomials with roots in a semialgebraic set.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2004

Integer programming, Barvinok's counting algorithm and Gomory relaxations.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

Generating functions and duality for integer programs.

[BibT_eX]

[DOI]

Discret. Optim., 2004

A discrete Farkas lemma.

[BibT_eX]

[DOI]

Discret. Optim., 2004

The Integer Hull of a Convex Rational Polytope.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2004

On parameter-dependent Lyapunov functions for robust stability of linear systems.

[BibT_eX]

[DOI]

Dimitri Peaucelle

Proceedings of the 43rd IEEE Conference on Decision and Control, 2004

2003

GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2003

On Counting Integral Points in a Convex Rational Polytope.

[BibT_eX]

[DOI]

Math. Oper. Res., 2003

Characterizing polynomials with roots in a semi-algebraic set.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE Conference on Decision and Control, 2003

2002

Analytic perturbation of Sylvester matrix equations.

[BibT_eX]

[DOI]

Konstantin Avrachenkov

IEEE Trans. Autom. Control., 2002

An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2002

Solving the knapsack problem via Z-transform.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2002

Semidefinite Programming vs. LP Relaxations for Polynomial Programming.

[BibT_eX]

[DOI]

Math. Oper. Res., 2002

Solving Global Optimization Problems over Polynomials with GloptiPoly 2.1.

[BibT_eX]

[DOI]

Proceedings of the Global Optimization and Constraint Satisfaction, 2002

2001

Pythagoras' Theorem for Areas.

[BibT_eX]

[DOI]

Jean-Pierre Quadrat

Jean-Baptiste Hiriart-Urruty

Am. Math. Mon., 2001

The Multi-Dimensional Version of ∫b a xp dx.

[BibT_eX]

[DOI]

Konstantin Avrachenkov

Am. Math. Mon., 2001

A Quick Proof for the Volume of n-Balls.

[BibT_eX]

[DOI]

Am. Math. Mon., 2001

Global Optimization with Polynomials and the Problem of Moments.

[BibT_eX]

[DOI]

SIAM J. Optim., 2001

A Laplace transform algorithm for the volume of a convex polytope.

[BibT_eX]

[DOI]

J. ACM, 2001

An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000

Zero-Sum Stochastic Games in Borel Spaces: Average Payoff Criteria.

[BibT_eX]

[DOI]

Onésimo Hernández-Lerma

SIAM J. Control. Optim., 2000

Why the logarithmic barrier function in convex and linear programming?

[BibT_eX]

[DOI]

Oper. Res. Lett., 2000

Convergent LMI relaxations for nonconvex quadratic programs.

[BibT_eX]

[DOI]

Konstantin E. Avrachenkov

Proceedings of the 39th IEEE Conference on Decision and Control, 2000

Analytic perturbation of Sylvester and Lyapunov matrix equations.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE Conference on Decision and Control, 2000

1999

Sample-path average optimality for Markov control processes.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1999

1998

Approximation Schemes for Infinite Linear Programs.

[BibT_eX]

[DOI]

Onésimo Hernández-Lerma

SIAM J. Optim., 1998

Multi-resource shop scheduling with resource flexibility.

[BibT_eX]

[DOI]

Stéphane Dauzère-Pérès

W. Roux

Eur. J. Oper. Res., 1998

1997

Tight bounds for the trace of a matrix product.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1997

Lot Streaming in Job-Shop Scheduling.

[BibT_eX]

[DOI]

Stéphane Dauzère-Pérès

Oper. Res., 1997

1995

A trace inequality for matrix product.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1995

A new Farkas lemma for positive semidefinite matrices.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1995

1994

Linear programming formulation of MDPs in countable state space: The multichain case.

[BibT_eX]

[DOI]

Arie Hordijk

Math. Methods Oper. Res., 1994

1993

Reachable, controllable sets and stabilizing control of constrained linear systems.

[BibT_eX]

[DOI]

Autom., 1993

1992

Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling.

[BibT_eX]

Maurice Queyranne

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1985

Technical Note - The Stochastic Discrete Dynamic Lot Size Problem: An Open-Loop Solution.

[BibT_eX]

[DOI]

C. Bes

François Roubellat

Oper. Res., 1985

1981

An economic interpretation of exact penalty functions using sensitivity analysis.

[BibT_eX]

[DOI]