Integer and Combinatorial Optimization

Nemhauser, George L.; Wolsey, Laurence A.

doi:10.1002/9781118627372

Cited by 3,738 publications

(2,714 citation statements)

References 0 publications

Supporting

Mentioning

2,640

Contrasting

Unclassified

Order By: Relevance

“…Prat, Comyn-Wattiau, & Akoka, 2015). We use integer programming (Nemhauser & Wolsey, 1988) to find the optimal solution for both optimisation models. For this purpose, our presented non-linear optimisation models are transformed into linear ones, which are used throughout the evaluation.…”

Section: Discussionmentioning

confidence: 99%

“…With evaluating a NP-hard problem (Abu-Khzam, Bazgan, Haddad, & Sikora, 2015) and an approach determining the optimal solution, we expect an over-proportional growth in computation time with increasing problem size (Nemhauser & Wolsey, 1988). Computation time in the context of service selection usually depends on several parameters (Alrifai & Risse, 2009).…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Service selection in mobile environments: considering multiple users and context-awareness

Heinrich

Mayer

2018

Journal of Decision Systems

View full text Add to dashboard Cite

In mobile environments, users often need to coordinate their actions with other users with regard to user-individual context information like current location when selecting suitable services for a process. Thereby, some users may prefer to conduct particular services together with certain other users. Such multi-user context-aware service selections could result in complex decision problems – making decision support for the participating users highly valuable or even necessary. To do so, we propose an optimisation-based service selection approach for multi-user context-aware processes. We also show how our approach provides decision support by evaluating its efficacy based on a real-world scenario.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Service selection in mobile environments: considering multiple users and context-awareness

Heinrich

Mayer

2018

Journal of Decision Systems

View full text Add to dashboard Cite

show abstract

“…As an alternative to solving (Rob-LP), a cutting-plane approach (Nemhauser and Wolsey, 1988) has been investigated.…”

Section: The Multiband Robustness Modelmentioning

confidence: 99%

Multiband Robust Optimization and its Adoption in Harvest Scheduling

D’Andreagiovanni¹,

Raymond

2014

FORMATH

View full text Add to dashboard Cite

Abstract:A central assumption in classical optimization is that all the input data of a problem are exact. However, in many real-world problems, the input data are subject to uncertainty. In such situations, neglecting uncertainty may lead to nominally optimal solutions that are actually suboptimal or even infeasible. Robust optimization offers a remedy for optimization under uncertainty by considering only the subset of solutions protected against the data deviations. In this paper, we provide an overview of the main theoretical results of multiband robustness, a new robust optimization model that extends and refines the classical theory introduced by Bertsimas and Sim. After introducing some new results for the special case of pure binary programs, we focus on the harvest scheduling problem and show how multiband robustness can be adopted to tackle the uncertainty affecting the volume of produced timber and grant a reduction in the price of robustness.

show abstract

“…O problema para cuja solução pretendemos apresentar e comparar algoritmos é o chamado problema não capacitado de fluxos com custos fixos nos arcos, NCFCF (Nemhauser & Wolsey, 1988). O problema NCFCF pertence à grande classe de problemas de otimização em redes formando ele próprio uma subclasse bem peculiar de modelos com muitas aplicações práticas de interesse.…”

Section: Figura 1 -Grafo G=(n={ijkl} E={(ij)(ji)(ik)(jk)(unclassified

Algoritmos Para O Problema Não Capacitado De Fluxos Com Custos Fixos Nos Arcos: Uma Comparação Estatística

Cruz¹,

Colosimo²,

Mateus

2001

Pesqui. Oper.

View full text Add to dashboard Cite

ResumoEste trabalho tem como propósito a apresentação de resultados de uma comparação empírica entre algoritmos, sendo este um dos assuntos mais recorrentes na área de desenvolvimento de algoritmos. Os algoritmos sob estudo são para resolver um problema de otimização em redes, importante pelas suas aplicações potenciais em sistemas de telefonia e transporte, o problema não capacitado de fluxos com custos fixos nos arcos (NCFCF), uma generalização do clássico problema de Steiner em grafos. Para tal, são utilizadas ferramentas estatísticas conhecidas tais como planejamento de experimentos, análise de variância e intervalos de confiança, mas não comumente empregadas neste tipo de estudo. O problema NCFCF é apresentado em uma modelagem de programação matemática inteira mista, baseada na qual os algoritmos sob consideração são apresentados. Uma descrição do planejamento de experimentos adequado a este tipo de estudo é apresentada e é ilustrado o uso da técnica estatística baseado em cuja análise foi possível classificar os algoritmos sob consideração. Palavras-chave: otimização em redes, problemas de Steiner, ANOVA. AbstractThis paper is concerned about empirical comparisons of algorithms, one of the most recurrent issues in the field of design of algorithms. The problem under consideration is the uncapacitated fixed-charge network flow (UFCNF) problem, a generalization of the classic Steiner problem in graphs. The UFCNF is very important in the practical point of view because of its potential applications for telecommunication and transportation system design. In order to compare the algorithms for the UFCNF problem, we make use of well known and well established statistical tools namely the design of experiments, analysis of variance, and confidence intervals, but rarely applied in such studies. A mixed-integer mathematical programming formulation is presented for the UFCNF problem and the design of experiments suitable for the empirical study is detailed. Finally, the statistical analysis based on which the algorithms could be classified is presented.

show abstract

Integer and Combinatorial Optimization

Cited by 3,738 publications

References 0 publications

Service selection in mobile environments: considering multiple users and context-awareness

Service selection in mobile environments: considering multiple users and context-awareness

Multiband Robust Optimization and its Adoption in Harvest Scheduling

Algoritmos Para O Problema Não Capacitado De Fluxos Com Custos Fixos Nos Arcos: Uma Comparação Estatística

Contact Info

Product

Resources

About