Norm bounds and underestimators for unconstrained polynomial integer minimization

JOURNAL ARTICLE published February 2018 in Mathematical Methods of Operations Research

Authors: Sönke Behrends | Ruth Hübner | Anita Schöbel

The blockwise coordinate descent method for integer programs

JOURNAL ARTICLE published April 2020 in Mathematical Methods of Operations Research

Authors: Sven Jäger | Anita Schöbel

Ellipsoid Bounds for Convex Quadratic Integer Programming

JOURNAL ARTICLE published January 2015 in SIAM Journal on Optimization

Authors: Christoph Buchheim | Ruth Hübner | Anita Schöbel

Convex Underestimators

BOOK CHAPTER published 2005 in International Series of Numerical Mathematics

Authors: Ivo Nowak

Geometric and algebraic approaches to mixed-integer polynomial optimization using sos programming

DISSERTATION published

Authors: Sönke Behrends

Variants of the $$ varepsilon $$ ε -constraint method for biobjective integer programming problems: application to p-median-cover problems

JOURNAL ARTICLE published April 2018 in Mathematical Methods of Operations Research

Authors: Jesús Sáez-Aguado | Paula Camelia Trandafir

Optimal investment and consumption under partial information

JOURNAL ARTICLE published February 2016 in Mathematical Methods of Operations Research

Authors: Kristoffer Lindensjö

Least-Norm Linear Programming Solution as an Unconstrained Minimization Problem.

REPORT published 1 December 1980

Authors: O. L. Mangasarian

Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators

BOOK CHAPTER published 2014 in Integer Programming and Combinatorial Optimization

Authors: Christoph Buchheim | Claudia D’Ambrosio

Generalized light robustness and the trade-off between robustness and nominal quality

JOURNAL ARTICLE published October 2014 in Mathematical Methods of Operations Research

Authors: Anita Schöbel

Computational bounds for elevator control policies by large scale linear programming

JOURNAL ARTICLE published February 2014 in Mathematical Methods of Operations Research

Authors: Stefan Heinz | Jörg Rambau | Andreas Tuchscherer

Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization

JOURNAL ARTICLE published August 2011 in Mathematical Methods of Operations Research

Authors: Sven O. Krumke | Clemens Thielen | Christiane Zeck

Combination of two underestimators for univariate global optimization

JOURNAL ARTICLE published January 2018 in RAIRO - Operations Research

Authors: Mohand Ouanes | Mohammed Chebbah | Ahmed Zidna

Component importance based on dependence measures

JOURNAL ARTICLE published April 2018 in Mathematical Methods of Operations Research

Authors: Mario Hellmich

An inexact proximal regularization method for unconstrained optimization

JOURNAL ARTICLE published February 2017 in Mathematical Methods of Operations Research

Authors: Paul Armand | Isaï Lankoandé

A cost minimization heuristic for the pooling problem

JOURNAL ARTICLE published November 2014 in Annals of Operations Research

Authors: Mohammed Alfaki | Dag Haugland

When polynomial approximation meets exact computation

JOURNAL ARTICLE published December 2018 in Annals of Operations Research

Authors: Vangelis Th. Paschos

The double pivot simplex method

JOURNAL ARTICLE published February 2018 in Mathematical Methods of Operations Research

Authors: Fabio Vitor | Todd Easton

Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization

JOURNAL ARTICLE published April 2017 in Journal of Global Optimization

Research funded by EU (FP7-PEOPLE-2012 - ITN no. 316647,FP7-PEOPLE-2012 - ITN no. 316647) | Agence Nationale de la Recherche (FR) (12-JS02-009-01 “ATOMIC”)

Authors: Christoph Buchheim | Claudia D’Ambrosio

Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming

JOURNAL ARTICLE published February 2011 in Mathematical Methods of Operations Research

Authors: Jian Zhang | Kecun Zhang