UB Paderborn / Katalog / Suche / in CDI

On the computation of protein backbones by using artificial backbones of hydrogens

Journal of global optimization, 2011-06, Vol.50 (2), p.329-344

2011

Link zum Volltext

Verfügbarkeit prüfen

On the choice of parameters for the weighting method in vector optimization

Mathematical programming, 2008-01, Vol.111 (1-2), p.201-216

2008

Link zum Volltext

Verfügbarkeit prüfen

Convergence analysis of a generalized proximal algorithm for multiobjective quasiconvex minimization on Hadamard manifolds

Optimization, 2023-07, Vol.ahead-of-print (ahead-of-print), p.1-26

2023

Link zum Volltext

Verfügbarkeit prüfen

The volume algorithm revisited: relation with bundle methods

Mathematical programming, 2002-12, Vol.94 (1), p.41-69

2002

Link zum Volltext

Verfügbarkeit prüfen

A Study of the Compartimentalized Knapsack Problem with Additional Restrictions

Revista IEEE América Latina, 2010-06, Vol.8 (3), p.269-274

2010

Link zum Volltext
IEEE_Xplore

Solving Hartree-Fock systems with global optimization methods

Europhysics letters, 2007-03, Vol.77 (5), p.50006-50006 (5)

2007

Link zum Volltext

Verfügbarkeit prüfen

A strong flow-based formulation for the shortest path problem in digraphs with negative cycles

International transactions in operational research, 2009-05, Vol.16 (3), p.361-369

2009

Link zum Volltext

Verfügbarkeit prüfen

B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty

Annals of operations research, 2005-11, Vol.140 (1), p.49-65

2005

Link zum Volltext

Verfügbarkeit prüfen

On the choice of parameters for the weighting method in vector optimization

Mathematical programming, 2008-03, Vol.112 (1), p.273-273

2008

Link zum Volltext

Verfügbarkeit prüfen

Telecommunication Network Capacity Design for Uncertain Demand

Computational optimization and applications, 2004-11, Vol.29 (2), p.127-146

2004

Link zum Volltext

Verfügbarkeit prüfen

Reducing the Setup of a Tubettes Machine

Revista IEEE América Latina, 2010-03, Vol.8 (1), p.101-106

2010

Link zum Volltext
IEEE_Xplore

A Smoothing Optimization Approach Applied to the Supervised MDS Method

Revista IEEE América Latina, 2020-07, Vol.18 (7), p.1209-1214

2020

Link zum Volltext
IEEE_Xplore

What will be the proxy value for a Brazilian utility company triggering its demand side management in the light of price elasticity of demand?

Revista IEEE América Latina, 2016-08, Vol.14 (8), p.3746-3754

2016

Link zum Volltext
IEEE_Xplore

Stronger K-tree relaxations for the vehicle routing problem

European journal of operational research, 2004-10, Vol.158 (1), p.56-71

2004

Link zum Volltext

Verfügbarkeit prüfen

Reformulation techniques in mathematical programming

Discrete Applied Mathematics, 2009-03, Vol.157 (6), p.1165-1166

2009

Link zum Volltext

Verfügbarkeit prüfen

A note on the NP-hardness of the separation problem on some valid inequalities for the elementary shortest path problem

Pesquisa Operacional, 2014-04, Vol.34 (1), p.117-124

2014

Link zum Volltext

Verfügbarkeit prüfen

Using Lagrangian dual information to generate degree constrained spanning trees

Discrete Applied Mathematics, 2006-04, Vol.154 (5), p.703-717

2006

Link zum Volltext

Verfügbarkeit prüfen

An O(n) algorithm for projecting a vector on the intersection of a hyperplane and a box in Rn

Journal of optimization theory and applications, 2003-06, Vol.117 (3), p.553-574

2003

Link zum Volltext

Verfügbarkeit prüfen

A Function to Test Methods Applied to Global Minimization of Potential Energy of Molecules

Numerical algorithms, 2004-04, Vol.35 (2-4), p.287-300

2004

Link zum Volltext

Verfügbarkeit prüfen

A greedy search for the three-dimensional bin packing problem: the packing static stability case

International transactions in operational research, 2003-03, Vol.10 (2), p.141-153

2003

Link zum Volltext

Verfügbarkeit prüfen

A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem

European journal of operational research, 2005-09, Vol.165 (3), p.649-656

2005

Link zum Volltext

Verfügbarkeit prüfen

Using a Conic Formulation for Finding Steiner Minimal Trees

Numerical algorithms, 2004-04, Vol.35 (2-4), p.315-330

2004

Link zum Volltext

Verfügbarkeit prüfen

A hybrid genetic algorithm for finding stable conformations of small molecules

Proceedings. Vol.1. Sixth Brazilian Symposium on Neural Networks, 2000, p.90-94

2000

Link zum Volltext
IEEE_Xplore

A Boolean Penalty Method for Zero-One Nonlinear Programming

Journal of global optimization, 2000-04, Vol.16 (4), p.343

2000

Link zum Volltext

Verfügbarkeit prüfen

A column generation approach for SONET ring assignment

Networks, 2006-05, Vol.47 (3), p.157-171

2006

Link zum Volltext

Verfügbarkeit prüfen

Menü

Weitere Dienste

Einstellungen

On the computation of protein backbones by using artificial backbones of hydrogens

On the choice of parameters for the weighting method in vector optimization

Convergence analysis of a generalized proximal algorithm for multiobjective quasiconvex minimization on Hadamard manifolds

The volume algorithm revisited: relation with bundle methods

A Study of the Compartimentalized Knapsack Problem with Additional Restrictions

Solving Hartree-Fock systems with global optimization methods

A strong flow-based formulation for the shortest path problem in digraphs with negative cycles

B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty

On the choice of parameters for the weighting method in vector optimization

Telecommunication Network Capacity Design for Uncertain Demand

Reducing the Setup of a Tubettes Machine

A Smoothing Optimization Approach Applied to the Supervised MDS Method

What will be the proxy value for a Brazilian utility company triggering its demand side management in the light of price elasticity of demand?

Stronger K-tree relaxations for the vehicle routing problem

Reformulation techniques in mathematical programming

A note on the NP-hardness of the separation problem on some valid inequalities for the elementary shortest path problem

Using Lagrangian dual information to generate degree constrained spanning trees

An O(n) algorithm for projecting a vector on the intersection of a hyperplane and a box in Rn

A Function to Test Methods Applied to Global Minimization of Potential Energy of Molecules

A greedy search for the three-dimensional bin packing problem: the packing static stability case

A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem

Using a Conic Formulation for Finding Steiner Minimal Trees

A hybrid genetic algorithm for finding stable conformations of small molecules

A Boolean Penalty Method for Zero-One Nonlinear Programming

A column generation approach for SONET ring assignment

Suchergebnisse filtern