Frédéric Messine

J. Glob. Optim., 2022

Correction to: Numerical certification of Pareto optimality for biobjective nonlinear problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2022

Numerical certification of Pareto optimality for biobjective nonlinear problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2022

On Monotonicity Detection in Simplicial Branch and Bound over a Simplex.

[BibT_eX]

[DOI]

Boglárka G.-Tóth

Proceedings of the Computational Science and Its Applications - ICCSA 2022 Workshops, 2022

2021

On derivative based bounding for simplicial branch and bound.

[BibT_eX]

[DOI]

Boglárka G.-Tóth

RAIRO Oper. Res., 2021

On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic.

[BibT_eX]

[DOI]

Boglárka G.-Tóth

J. Glob. Optim., 2021

An interval branch and bound method for global Robust optimization.

[BibT_eX]

[DOI]

Emilio Carrizosa

Hamza Idrissi Hassani Azami

J. Glob. Optim., 2021

2018

Optimal Control for Energy Management of Connected Hybrid Electrical Vehicles - Predictive Connectivity Compared to an Adaptive Algorithm.

[BibT_eX]

[DOI]

Stéphane Caux

Mariano Sans

Proceedings of the 4th International Conference on Vehicle Technology and Intelligent Transport Systems, 2018

2017

Heuristics and lower bounds for minimizing fuel consumption in hybrid-electrical vehicles.

[BibT_eX]

[DOI]

Sandra Ulrich Ngueveu

Stéphane Caux

Mouloud Guemri

4OR, 2017

2016

A numerical optimal control method for solving a large thermic process.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2016

Design of space thrusters: a topology optimization problem solved via a Branch and Bound method.

[BibT_eX]

[DOI]

Satafa Sanogo

J. Glob. Optim., 2016

2015

Efficient upper and lower bounds for global mixed-integer optimal control.

[BibT_eX]

[DOI]

Sebastian Sager

Mathieu Claeys

J. Glob. Optim., 2015

A reliable affine relaxation method for global optimization.

[BibT_eX]

[DOI]

4OR, 2015

2014

On finding optimal parameters of an oscillatory model of handwriting.

[BibT_eX]

[DOI]

Gaëtan André

RAIRO Oper. Res., 2014

A Branch and Bound algorithm for minimizing the energy consumption of an electrical vehicle.

[BibT_eX]

[DOI]

Abdelkader Merakeb

Mohamed Aidène

4OR, 2014

2013

Finding largest small polygons with GloptiPoly.

[BibT_eX]

[DOI]

Didier Henrion

J. Glob. Optim., 2013

Toulouse Global optimization Workshop 2010 (TOGO10).

[BibT_eX]

[DOI]

Sonia Cafieri

Leo Liberti

J. Glob. Optim., 2013

On interval branch-and-bound for additively separable functions with common variables.

[BibT_eX]

[DOI]

José L. Berenguel

Inmaculada García

J. Glob. Optim., 2013

The Small Octagons of Maximal Width.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Frequency assignment in a SDMA satellite communication system with beam decentring feature.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2013

A decomposition-based optimal control approach for aircraft conflict avoidance performed by velocity regulation.

[BibT_eX]

[DOI]

Loïc Cellier

Sonia Cafieri

Proceedings of the International Conference on Application and Theory of Automation in Command and Control Systems, 2013

2012

Compact Relaxations for Polynomial Programming Problems.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

On Lower Bounds Using Additively Separable Terms in Interval B&B.

[BibT_eX]

[DOI]

José L. Berenguel

Inmaculada García

Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012

Frequency allocation in a SDMA satellite communication system with beam moving.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2012

2011

A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms.

[BibT_eX]

[DOI]

J. Glob. Optim., 2011

The small hexagon and heptagon with maximum sum of distances between vertices.

[BibT_eX]

[DOI]

J. Glob. Optim., 2011

2010

A note on diameters of point sets.

[BibT_eX]

[DOI]

Optim. Lett., 2010

2009

Simple Polygons of Maximum Perimeter Contained in a Unit Disk.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Isoperimetric Polygons of Maximum Width.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

2007

Comparison Between Baumann and Admissible Simplex Forms in Interval Analysis.

[BibT_eX]

[DOI]

Jean-Louis Lagouanelle

J. Glob. Optim., 2007

An exact global optimization method for deriving weights from pairwise comparison matrices.

[BibT_eX]

[DOI]

Emilio Carrizosa

J. Glob. Optim., 2007

Extremal problems for convex polygons.

[BibT_eX]

[DOI]

J. Glob. Optim., 2007

The small octagon with longest perimeter.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2007

2006

A General Reliable Quadratic Form: An Extension of Affine Arithmetic.

[BibT_eX]

[DOI]

Ahmed Touhami

Reliab. Comput., 2006

2004

Deterministic global optimization using interval constraint propagation techniques.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2004

Improving Interval Analysis Bounds by Translations.

[BibT_eX]

[DOI]

Emilio Carrizosa

J. Glob. Optim., 2004

The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2004

2002

Extentions of Affine Arithmetic: Application to Unconstrained Global Optimization.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2002

The Largest Small Octagon.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2002

1998

Enclosure Methods for Multivariate Differentiable Functions and Application to Global Optimization.

[BibT_eX]

[DOI]