| Publication | Date of Publication | Type |
|---|
| Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization | 2024-01-22 | Paper |
| On distance graph coloring problems | 2023-11-21 | Paper |
| An integer linear optimization model to the compartmentalized knapsack problem | 2023-11-16 | Paper |
| A two-phase multi-objective metaheuristic for a green UAV grid routing problem | 2023-11-07 | Paper |
| A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$ | 2023-10-04 | Paper |
| Cycle-based formulations in distance geometry | 2023-07-12 | Paper |
| A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) | 2023-07-11 | Paper |
| Effects of multiple prepayments and green investment on an EPQ model | 2023-04-24 | Paper |
| Capacitated clustering problems applied to the layout of IT-teams in software factories | 2022-09-26 | Paper |
| Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\) | 2022-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5861896 | 2022-03-02 | Paper |
| A green inventory model with the effect of carbon taxation | 2022-01-20 | Paper |
| A cycle-based formulation for the distance geometry problem | 2021-12-08 | Paper |
| Using multiflow formulations to solve the Steiner tree problem in graphs | 2021-07-27 | Paper |
| A new penalty/stochastic approach to an application of the covering problem: The gamma knife treatment | 2021-07-27 | Paper |
| Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem | 2021-07-27 | Paper |
| Heuristic approach applied to the optimum stratification problem | 2021-07-22 | Paper |
| Improved robust shortest paths by penalized investments | 2021-07-19 | Paper |
| Preface | 2021-02-19 | Paper |
| Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds | 2020-09-10 | Paper |
| New proposals for modelling and solving the problem of covering solids using spheres of different radii | 2020-05-13 | Paper |
| Modelling and solving the perfect edge domination problem | 2020-04-27 | Paper |
| Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty | 2020-01-23 | Paper |
| A new formulation for the safe set problem on graphs | 2019-09-25 | Paper |
| A mathematical programming formulation for the Hartree-Fock problem on open-shell systems | 2019-05-10 | Paper |
| An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing | 2019-03-27 | Paper |
| Solving the bifurcated and nonbifurcated robust network loading problem with k‐adaptive routing | 2018-10-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4581915 | 2018-08-21 | Paper |
| The distance polytope for the vertex coloring problem | 2018-08-17 | Paper |
| \(k\)-adaptive routing for the robust network loading problem | 2018-04-11 | Paper |
| Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model | 2018-04-09 | Paper |
| On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds | 2018-01-12 | Paper |
| A co-opetitive framework for the hub location problems in transportation networks | 2017-12-15 | Paper |
| Feasibility check for the distance geometry problem: an application to molecular conformations | 2017-10-02 | Paper |
| Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds | 2017-06-30 | Paper |
| New error measures and methods for realizing protein graphs from distance data | 2017-03-23 | Paper |
| Hub-and-spoke network design and fleet deployment for string planning of liner shipping | 2016-12-06 | Paper |
| Single string planning problem arising in liner shipping industries: a heuristic approach | 2016-11-10 | Paper |
| Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles | 2016-11-10 | Paper |
| Iterated local search algorithms for the Euclidean Steiner tree problem inndimensions | 2016-10-27 | Paper |
| An overview of exact algorithms for the Euclidean Steiner tree problem inn-space | 2016-10-21 | Paper |
| An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs | 2016-10-18 | Paper |
| A speed and departure time optimization algorithm for the pollution-routing problem | 2016-10-06 | Paper |
| A Decomposition Algorithm for Nested Resource Allocation Problems | 2016-06-03 | Paper |
| A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem | 2016-04-01 | Paper |
| Clifford algebra and the discretizable molecular distance geometry problem | 2015-11-05 | Paper |
| Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles | 2015-03-23 | Paper |
| An evaluation of the bihyperbolic function in the optimization of the backpropagation algorithm | 2015-02-25 | Paper |
| Discretization orders for protein side chains | 2015-01-15 | Paper |
| A model to the ellipsoidal filling problem | 2014-04-16 | Paper |
| Euclidean Distance Geometry and Applications | 2014-04-09 | Paper |
| A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives | 2013-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4928164 | 2013-06-10 | Paper |
| Semidefinite relaxation for linear programs with equilibrium constraints | 2013-05-23 | Paper |
| Minmax regret combinatorial optimization problems: an Algorithmic Perspective | 2013-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4899827 | 2013-01-10 | Paper |
| Recent advances on the discretizable molecular distance geometry problem | 2012-12-29 | Paper |
| The discretizable molecular distance geometry problem | 2012-12-13 | Paper |
| Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization | 2012-11-15 | Paper |
| Multi-service multi-facility network design under uncertainty | 2012-11-15 | Paper |
| Hyperbolic smoothing and penalty techniques applied to molecular structure determination | 2012-04-05 | Paper |
| Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models | 2012-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109938 | 2012-01-26 | Paper |
| Molecular distance geometry methods: from continuous to discrete | 2011-08-17 | Paper |
| On the computation of protein backbones by using artificial backbones of hydrogens | 2011-06-03 | Paper |
| An iterative local search approach applied to the optimal stratification problem | 2011-05-20 | Paper |
| Um Método Determinístico para Otimização Global | 2011-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081840 | 2011-03-09 | Paper |
| A branch-and-cut algorithm for partition coloring | 2010-11-24 | Paper |
| Acyclic Orientations with Path Constraints | 2010-10-26 | Paper |
| Reformulations and solution algorithms for the maximum leaf spanning tree problem | 2010-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3565732 | 2010-06-07 | Paper |
| An exact algorithm for the stratification problem with proportional allocation | 2010-05-03 | Paper |
| An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem | 2010-03-06 | Paper |
| A strong flow-based formulation for the shortest path problem in digraphs with negative cycles | 2009-10-21 | Paper |
| An existence result for Minty variational inequalities | 2009-08-03 | Paper |
| Double variable neighbourhood search with smoothing for the molecular distance geometry problem | 2009-07-13 | Paper |
| The tricriterion shortest path problem with at least two bottleneck objective functions | 2009-06-29 | Paper |
| Editorial: Reformulation techniques in mathematical programming | 2009-06-23 | Paper |
| A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs | 2009-06-23 | Paper |
| Reformulation in mathematical programming: An application to quantum chemistry | 2009-06-23 | Paper |
| Edge-swapping algorithms for the minimum fundamental cycle basis problem | 2009-04-27 | Paper |
| Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem | 2009-02-17 | Paper |
| A New Neighborhood for the QAP | 2008-06-05 | Paper |
| A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem | 2008-05-22 | Paper |
| A note on characterizing canonical cuts using geometry | 2008-03-19 | Paper |
| On the choice of parameters for the weighting method in vector optimization | 2008-01-21 | Paper |
| A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule | 2007-12-10 | Paper |
| Computational Experience with the Molecular Distance Geometry Problem | 2007-11-27 | Paper |
| New formulations for the Kissing Number Problem | 2007-09-19 | Paper |
| The one dimensional Compartmentalised Knapsack problem: a case study | 2007-08-27 | Paper |
| Algorithms for finding minimum fundamental cycle bases in graphs | 2007-05-29 | Paper |
| The Kissing Number Problem: A New Result from Global Optimization | 2007-05-29 | Paper |
| A column generation approach for SONET ring assignment | 2006-06-06 | Paper |
| Using Lagrangian dual information to generate degree constrained spanning trees | 2006-04-28 | Paper |
| B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty | 2006-03-07 | Paper |
| A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem | 2005-04-21 | Paper |
| Telecommunication network capacity design for uncertain demand | 2005-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4815881 | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4811405 | 2004-09-06 | Paper |
| A function to test methods applied to global minimization of potential energy of molecules | 2004-08-10 | Paper |
| Using a conic formulation for finding Steiner minimal trees | 2004-08-10 | Paper |
| A greedy search for the three-dimensional bin packing problem: the packing static stability case | 2004-08-10 | Paper |
| Stronger \(K\)-tree relaxations for the vehicle routing problem | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4464673 | 2004-05-27 | Paper |
| Column-Generation in Integer Linear Programming | 2004-02-15 | Paper |
| A Boolean penalty method for zero-one nonlinear programming | 2004-01-27 | Paper |
| An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407335 | 2003-06-29 | Paper |
| Performance evaluation of a family of criss-cross algorithms for linear programming | 2003-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776573 | 2003-03-12 | Paper |
| Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée | 2002-08-18 | Paper |
| A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ | 2002-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741499 | 2001-10-24 | Paper |
| A new formulation for scheduling unrelated processor under precedence constraints | 2001-04-19 | Paper |
| The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation | 2001-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768053 | 2001-01-01 | Paper |
| Characterizing and edge-colouring split-indifference graphs | 1998-06-02 | Paper |
| A trust region method for zero-one nonlinear programming | 1998-01-21 | Paper |
| A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$ | 1997-09-02 | Paper |
| Lagrangean methods for 0-1 quadratic problems | 1993-06-29 | Paper |
| Lagrangean Decomposition In Integer Linear Programming: A New Scheme | 1992-09-27 | Paper |
| An approach for the Steiner problem in directed graphs | 1992-06-27 | Paper |
| Lagrangean decomposition for integer nonlinear programming with linear constraints | 1992-06-27 | Paper |
| A lower bound for the shortest Hamiltonean path in directed graphs | 1992-06-25 | Paper |
| A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\) | 1989-01-01 | Paper |
| An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818338 | 1988-01-01 | Paper |
| Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3760270 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197844 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3325466 | 1984-01-01 | Paper |
| Relaxation Lagrangienne: Le Probleme Du Knapsack 0–1† | 1983-01-01 | Paper |
| The Administration of Standard Length Telephone Cable Reels | 1981-01-01 | Paper |
