Publicação

Numerical experiments with nonconvex MINLP problems

Detalhes bibliográficos
Resumo:	We present a methodology to solve nonconvex Mixed-Integer Nonlinear Programming problems, that combines the Branch-and-Bound and simulated annealing type methods, which was implemented in MATLAB. A set of benchmark functions with simple bounds and different dimensions was used to analyze its practical behaviour. We exhibit computational results showing the good performance of the method.
Autores principais:	Fernandes, Florbela P.
Outros Autores:	Costa, Maria F.P.; Fernandes, Edite M.G.P.
Assunto:	Mixed-integer programming Branch-and-bound Stochastic method
Ano:	2010
País:	Portugal
Tipo de documento:	comunicação em conferência
Tipo de acesso:	acesso aberto
Instituição associada:	Instituto Politécnico de Bragança
Idioma:	inglês
Origem:	Biblioteca Digital do IPB

Registos relacionados

Numerical experiments with nonconvex MINLP problems
por: Costa, M. Fernanda P.
Publicado em: (2010)

A deterministic-stochastic method for nonconvex MINLP problems
por: Fernandes, Florbela P.
Publicado em: (2010)

A deterministic-stochastic method for nonconvex MINLP problems
por: Fernandes, Florbela P.
Publicado em: (2010)

A deterministic-stochastic method for nonconvex MINLP problems
por: Costa, M. Fernanda P.
Publicado em: (2010)

Assessment of a hybrid approach for nonconvex constrained MINLP problems
por: Fernandes, Florbela P.
Publicado em: (2011)

Assessment of a hybrid approach for nonconvex constrained MINLP problems
por: Costa, M. Fernanda P.
Publicado em: (2011)

Overview on mixed integer nonlinear programming problems
por: Fernandes, Florbela P.
Publicado em: (2009)

Overview on mixed integer nonlinear programming problems
por: Fernandes, Florbela P.
Publicado em: (2009)

Interrupted searches in the BBMCSFilter context for MINLP problems
por: Fernandes, Florbela P.
Publicado em: (2016)

Interrupted searches in the BBMCSFilter context for MINLP problems
por: Fernandes, Florbela P.
Publicado em: (2016)

Branch and bound based coordinate search filter algorithm for nonsmooth nonconvex mixed-integer nonlinear programming problems
por: Fernandes, Florbela P.
Publicado em: (2014)

Branch and bound based coordinate search filter algorithm for nonsmooth nonconvex mixed-integer nonlinear programming problems
por: Fernandes, Florbela P.
Publicado em: (2014)

The teacher assignment problem: A special case of the fixed charge transportation problem
por: Hultberg, T.H.
Publicado em: (1997)

Algoritmos de partição e geração de colunas para dimensionamento de lotes de produção
por: Pimentel,Carina Maria Oliveira
Publicado em: (2006)

Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
por: Pimentel, Carina
Publicado em: (2010)

Optimal Scheduling of Joint Wind-Thermal Systems
por: Laia, Rui
Publicado em: (2018)

Branch-and-bound for the hypervolume subset selection problem
por: Gomes, Ricardo Jorge Pires
Publicado em: (2017)

Efficient primal-dual heuristic for a dynamic location problem
por: Dias, Joana
Publicado em: (2007)

Univariate parameterization for global optimization of mixed-integer polynomial problems
por: Teles, João P.
Publicado em: (2013)

Solving the quadratic 0-1 problem
por: Schutz, G.
Publicado em: (2000)

Branch-and-bound reduction type method for semi-infinite programming
por: Pereira, Ana I. P. N.
Publicado em: (2011)

An exact composite lower bound strategy for the resource-constrained project scheduling problem
por: Coelho, José
Publicado em: (2018)

Offer strategy for a wind power producer in day-ahead market
por: Melicio, Rui
Publicado em: (2015)

A new branch-and-price approach for the kidney exchange problem
por: Klimentova, Xenia
Publicado em: (2014)

Implementing and testing branch-and-bound algorithm for the quadratic 0-1 problem on transputers
por: Schutz, G.
Publicado em: (1997)

Bidding Decision of Wind-Thermal GenCo in Day-Ahead Market
por: Laia, Rui
Publicado em: (2017)

Bidding strategy of wind-thermal energy producers
por: Laia, Rui
Publicado em: (2017)

Bidding decision of wind-thermal GenCo in day-ahead market
por: Laia, R.
Publicado em: (2016)

Bidding strategy of wind-thermal energy producers
por: Laia, R.
Publicado em: (2016)

A computational study of a parallel Branch and Bound algorithm for the quadratic 0-1 programming problem on transputers
por: Schutz, G.
Publicado em: (1996)

Offering Strategies of Wind Power Producers in a Day-Ahead Electricity Market
por: Melicio, Rui
Publicado em: (2015)

Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
por: Castro, Pedro
Publicado em: (2014)

A new Branch and Bound method for a discrete truss topology design problem
por: Cerveira, Adelaide
Publicado em: (2013)

Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity
por: Martins, Isabel
Publicado em: (2023)

Algorithms for the star discrepancy subset selection problem
por: Martins, Gonçalo Nuno Côrte-real
Publicado em: (2019)

A Branch and Bound approach for truss topology design problems with valid inequalities
por: Cerveira, A.
Publicado em: (2010)

Coordinated Scheduling of Wind-Thermal Gencos in Day-Ahead Markets
por: Laia, Rui
Publicado em: (2016)

Optimal Bidding Strategies of Wind-Thermal Power Producers
por: Rui, Laia
Publicado em: (2018)

Models for multi-depot routing problems
por: Santos, Daniel
Publicado em: (2019)

A penalty approach for solving nonsmooth and nonconvex MINLP problems
por: Costa, M. Fernanda P.
Publicado em: (2018)