Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2024
Quantum annealing-driven branch and bound for the single machine total weighted number of tardy jobs scheduling problem
Future Generation Computer Systems (FGCS), Volume 155, Issue CPages 245–255https://doi.org/10.1016/j.future.2024.02.016AbstractIn the paper we present a new approach to solving NP-hard problems of discrete optimization adapted to the architecture of quantum processors (QPU, Quantum Processor Unit) implementing hardware quantum annealing. This approach is based on the use ...
Highlights
- We propose the use of D-Wave quantum calculations environment in the branch and bound algorithm.
- A quantum processor-driven exact algorithm solves the scheduling problem.
- Even though the nature of quantum computing is probabilistic,...
- research-articleJanuary 2023
On generating Pareto optimal set in bi-objective reliable network topology design
International Journal of Grid and Utility Computing (IJGUC), Volume 14, Issue 4Pages 339–355https://doi.org/10.1504/ijguc.2023.132616This paper considers an NP-hard network topology design (NTD) problem called NTD-CB/R. A key challenge when solving the bi-objective optimisation problem is to simultaneously minimise cost while maximising bandwidth. This paper aims to generate the best ...
- research-articleFebruary 2019
Minimizing Flow Rules for Rerouting Multi-Flows in Multi-Failure Recovery over SDN
ICSCA '19: Proceedings of the 2019 8th International Conference on Software and Computer ApplicationsPages 555–559https://doi.org/10.1145/3316615.3316684The software defined networks (SDN) is a new network paradigm that supports logical central control. For the failure recovery in SDN, most existing research mainly addressed single failure scenario or single flow rerouting. However, considering multi-...
- articleApril 2018
Two Approaches to Stochastic Optimal Control Problems with a Final-Time Expectation Constraint
Applied Mathematics and Optimization (APMO), Volume 77, Issue 2Pages 377–404https://doi.org/10.1007/s00245-016-9378-9In this article, we study and compare two approaches to solving stochastic optimal control problems with an expectation constraint on the final state. The case of a probability constraint is included in this framework. The first approach is based on a ...
- research-articleDecember 2017
A novel SDN controller based on Ontology and Global Optimization for heterogeneous IoT architecture
SoICT '17: Proceedings of the 8th International Symposium on Information and Communication TechnologyPages 293–300https://doi.org/10.1145/3155133.3155143Today, our modern living world is covered by ubiquitous systems that offer the ability to assess, understand and handle the environmental indicators of our urban environment as well as our delicate ecology and natural resources. The sudden increase of ...
- articleMarch 2017
Relaxations and discretizations for the pooling problem
Journal of Global Optimization (KLU-JOGO), Volume 67, Issue 3Pages 631–669https://doi.org/10.1007/s10898-016-0434-4The pooling problem is a folklore NP-hard global optimization problem that finds applications in industries such as petrochemical refining, wastewater treatment and mining. This paper assimilates the vast literature on this problem that is dispersed ...
- articleAugust 2015
Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
We study the multi-item capacitated lot sizing problem with setup times. Based on two strong reformulations of the problem, we present a transformed reformulation and valid inequalities that speed up column generation and Lagrange relaxation. We ...
- articleAugust 2015
Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
We study the multi-item capacitated lot sizing problem with setup times. Based on two strong reformulations of the problem, we present a transformed reformulation and valid inequalities that speed up column generation and Lagrange relaxation. We ...
- articleAugust 2015
Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
We study the multi-item capacitated lot sizing problem with setup times. Based on two strong reformulations of the problem, we present a transformed reformulation and valid inequalities that speed up column generation and Lagrange relaxation. We ...
- articleAugust 2015
Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
We study the multi-item capacitated lot sizing problem with setup times. Based on two strong reformulations of the problem, we present a transformed reformulation and valid inequalities that speed up column generation and Lagrange relaxation. We ...
- articleNovember 2014
Switching Transport Modes to Meet Voluntary Carbon Emission Targets
Transportation Science (TRNPS), Volume 48, Issue 4Pages 592–608https://doi.org/10.1287/trsc.2013.0481The transport sector is the second-largest carbon emissions contributor in Europe, and its emissions continue to increase. Many producers are committing themselves to reducing transport emissions voluntarily, possibly in anticipation of increasing ...
- research-articleDecember 2012
Integrated model for software component selection with simultaneous consideration of implementation and verification
Computers and Operations Research (CORS), Volume 39, Issue 12Pages 3376–3393https://doi.org/10.1016/j.cor.2012.04.020One important objective of component-based software engineering is the minimization of the development cost of software products. Thus, the costs of software component implementation and verification, which may involve substantial expenses while under ...
- articleJune 2011
Two-layer mesh network optimization based on inter-layer decomposition
Photonic Network Communications (SPPNC), Volume 21, Issue 3Pages 310–320https://doi.org/10.1007/s11107-010-0301-zPresently, backbone data networks are converging toward a typical two-layer architecture of an IP/MPLS layer over an optical layer. In this paper, we study the problem of maximizing a utility function for an Internet service provider (ISP) of a two-...
- articleDecember 2010
Computing budget allocation rules for multi-objective simulation models based on different measures of selection quality
Automatica (Journal of IFAC) (AJIF), Volume 46, Issue 12Pages 1935–1950https://doi.org/10.1016/j.automatica.2010.08.004In an optimal computing budget allocation problem, different measures of selection quality determine how the best set of designs can be identified and how the simulation budget should be allocated among the designs. In this paper, we look at several ...
- ArticleMay 2009
An Approach to Find Maximal Disjoint Paths with Reliability and Delay Constraints
AINA '09: Proceedings of the 2009 International Conference on Advanced Information Networking and ApplicationsPages 959–964https://doi.org/10.1109/AINA.2009.24Recently, multipaths solutions have been proposed to improve the quality-of-service (QoS) in communication networks (CN). Peng and Shen algorithm (PSA) was proposed to generate lamdaDP/DC – the maximum edge-disjoint-path-set with minimal cost subject to ...
- articleFebruary 2006
Heuristics for Joint Decisions in Production, Transportation, and Order Quantity
Transportation Science (TRNPS), Volume 40, Issue 1Pages 99–116https://doi.org/10.1287/trsc.1040.0111An attempt is made to tackle joint decisions in assigning production, lot size, transportation, and order quantity for single and multiple products in a production-distribution network system with multiple suppliers and multiple destinations. The ...
- articleMarch 2004
Improved lower bounds for the capacitated lot sizing problem with setup times
Operations Research Letters (OPERRL), Volume 32, Issue 2Pages 185–195https://doi.org/10.1016/j.orl.2003.06.001We present new lower bounds for the capacitated lot sizing problem, applying decomposition to the network reformulation. The demand constraints are the linking constraints and the problem decomposes into subproblems per period containing the capacity ...
- articleJune 2003
Bandwidth-delay constrained path selection under inaccurate state information
IEEE/ACM Transactions on Networking (TON), Volume 11, Issue 3Pages 384–398https://doi.org/10.1109/TNET.2003.813047One of the key issues in any quality-of-service (QoS) routing framework is how to compute a path that satisfies given QoS constraints. In this paper, we focus on the path computation problem subject to the bandwidth and delay constraints. This problem ...