We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 1-20 of 10,000 results
  1. A Lagrangian bounding and heuristic principle for bi-objective discrete optimization

    Lagrangian relaxation is a common and often successful way to approach computationally challenging single-objective discrete optimization problems...

    Torbjörn Larsson, Nils-Hassan Quttineh, Ida Åkerholm in Operational Research
    Article Open access 11 March 2024
  2. Discrete Optimization

    When solving optimization problems we typically have to make some discrete decisions because of natural constraints that may restrict decision...
    Konstantinos Gkiotsalitis in Public Transport Optimization
    Chapter 2022
  3. Discrete Stochastic Optimization for Public Health Interventions with Constraints

    Many public health threats exist, motivating the need to find optimal intervention strategies. Given the stochastic nature of the threats (e.g., the...

    Zewei Li, James C. Spall in Operations Research Forum
    Article 09 December 2022
  4. Mathematical modelling and a discrete cuckoo search particle swarm optimization algorithm for mixed model sequencing problem with interval task times

    This paper addresses a sequencing problem with uncertain task times in mixed model assembly lines. In this problem, task times are not known exactly...

    Jiahua Zhang, Xuemei Liu, Beikun Zhang in Journal of Intelligent Manufacturing
    Article 30 January 2024
  5. Enhanced migrating birds optimization algorithm for optimization problems in different domains

    Migrating birds optimization algorithm is a promising metaheuristic algorithm recently introduced to the optimization community. In this study, we...

    Ramazan Algin, Ali Fuat Alkaya, Mustafa Agaoglu in Annals of Operations Research
    Article Open access 21 May 2024
  6. Consensus Building for Uncertain Large-Scale Group Decision-Making Based on the Clustering Algorithm and Robust Discrete Optimization

    Consensus reaching processes (CRPs) including the feedback adjustment mechanism generally require extended periods of time to bridge the opinion gap...

    Yuanming Li, Ying Ji, Shaojian Qu in Group Decision and Negotiation
    Article 07 February 2022
  7. Simulation-based metaheuristic optimization algorithm for material handling

    Modern technologies and the emergent Industry 4.0 paradigm have empowered the emergence of flexible production systems suitable to cope with custom...

    Carolina Saavedra Sueldo, Ivo Perez Colo, ... Gerardo G. Acosta in Journal of Intelligent Manufacturing
    Article 28 February 2024
  8. A simulation-based optimization approach for the calibration of a discrete event simulation model of an emergency department

    Accurate modeling of the patient flow within an Emergency Department (ED) is required by all studies dealing with the increasing and well-known...

    Alberto De Santis, Tommaso Giovannelli, ... Massimo Roma in Annals of Operations Research
    Article 13 January 2022
  9. Cost scrutiny of discrete-time priority queue with cluster arrival and Bernoulli feedback

    This work describes the economic feasibility of a single server discrete-time queueing model, (Geo/G/1) where interarrival times have a geometric...

    Vaishnawi Shree, Shweta Upadhyaya, Rakhee Kulshrestha in OPSEARCH
    Article 29 March 2024
  10. A sequential choice model for multiple discrete demand

    Consumer demand in a marketplace is often characterized to be multiple discrete in that discrete units of multiple products are chosen together. This...

    Sanghak Lee, Sunghoon Kim, Sungho Park in Quantitative Marketing and Economics
    Article 07 April 2022
  11. Capacity and Patient Flow Problems: Solutions Using Queuing Analytics and Discrete Event Simulation

    A brief comparative overview is provided for queuing analytics and discrete event simulation. Comparative analysis is provided for 13 capacity and...
    Chapter 2024
  12. A novel two-phase trigonometric algorithm for solving global optimization problems

    Metaheuristics play a major role in the important domain of global optimization. Since they are problem independent, they can be effectively used in...

    A. Baskar, M. Anthony Xavior, ... Anna Burduk in Annals of Operations Research
    Article 21 March 2024
  13. Newton’s Method for Global Free Flight Trajectory Optimization

    Globally optimal free flight trajectory optimization can be achieved with a combination of discrete and continuous optimization. A key requirement is...

    Ralf Borndörfer, Fabian Danecker, Martin Weiser in Operations Research Forum
    Article Open access 08 August 2023
  14. Distributed continuous-time optimization for convex problems with coupling linear inequality constraints

    In this paper we propose a novel distributed continuous-time algorithm aimed to solve optimization problems with cost function being a sum of local...

    Oleg O. Khamisov in Computational Management Science
    Article 18 February 2024
  15. Robust combinatorial optimization problems under budgeted interdiction uncertainty

    In robust combinatorial optimization, we would like to find a solution that performs well under all realizations of an uncertainty set of possible...

    Marc Goerigk, Mohammad Khosravi in OR Spectrum
    Article Open access 05 June 2024
  16. Hybrid simplicial-randomized approximate stochastic dynamic programming for multireservoir optimization

    We revisit an approximate stochastic dynamic programming method that we proposed earlier for the optimization of multireservoir problems. The method...

    Luckny Zephyr, Bernard F. Lamond, Pascal Lang in Computational Management Science
    Article 10 May 2024
  17. Augmented simulation methods for discrete stochastic optimization with recourse

    We develop an augmented simulation approach to solve discrete stochastic optimization problems by converting them into a grand simulation problem in...

    Tahir Ekin, Stephen Walker, Paul Damien in Annals of Operations Research
    Article 21 October 2020
  18. A modified grey wolf optimization algorithm to solve global optimization problems

    The Grey Wolf Optimizer (GWO) algorithm is a very famous algorithm in the field of swarm intelligence for solving global optimization problems and...

    S. Gopi, Prabhujit Mohapatra in OPSEARCH
    Article 01 June 2024
  19. The value of shape constraints in discrete moment problems: a review and extension

    This research reviews the use of shape constraints in discrete moment problems. In particular, we investigate the impact of incorporating...

    Talal Alharbi, Anh Ninh, ... Munevver Mine Subasi in Annals of Operations Research
    Article 25 June 2022
  20. Assortment optimization: a systematic literature review

    Assortment optimization is a core topic of demand management that finds application in a broad set of different areas including retail, airline,...

    Julia Heger, Robert Klein in OR Spectrum
    Article Open access 16 April 2024
Did you find what you were looking for? Share feedback.