Operations Research and Optimization, 2nd Edition

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Engineering Mathematics".

Deadline for manuscript submissions: 31 October 2024 | Viewed by 589

Special Issue Editors


E-Mail Website
Guest Editor
Department of Production and Systems, Algoritmi Centre, University of Minho, 4710‐057 Braga, Portugal
Interests: operations research; integer programming; optimization
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Department of Mechanical Engineering, University of Coimbra, 3030-788 Coimbra, Portugal
Interests: operations research; computer science; industrial engineering; logistics
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Mathematical optimization and related approaches from the operations research field play a significant role in effectively solving complex problems on a wide variety of areas. Although these techniques are frequently associated with operations management, there is a record of successful applications in very different contexts. This Special Issue aims to be a platform to disseminate the recent advances on the field in the most distinct application areas. A non-exhaustive list of topics is as follows:

  • Integer linear programming and combinatorial optimization approaches;
  • Exact optimization algorithms: branch-and-bound, polyhedral approaches, decomposition-based methods, reformulations;
  • Heuristics, meta-heuristics, matheuristics and model-based metaheuristics for integer linear programming and combinatorial optimization;
  • Real-world applications in industry and services: operations management, supply chain management, logistics and transportation, scheduling, production management and distribution, warehousing, location, energy, telecommunications, project management, and healthcare;
  • Optimization software and decision support systems.

Prof. Dr. Cláudio Alves
Dr. Telmo Pinto
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • operations research
  • integer programming
  • optimization
  • exact optimization algorithms

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

9 pages, 308 KiB  
Article
The Constrained 2-Maxian Problem on Cycles
by Chunsong Bai and Jun Du
Mathematics 2024, 12(6), 876; https://doi.org/10.3390/math12060876 - 16 Mar 2024
Viewed by 330
Abstract
This paper deals with p-maxian problem on cycles with an upper bound on the distances of all facilities. We consider the case of p=2 and show that, in the worst case, the optimal solution contains at least one vertex of [...] Read more.
This paper deals with p-maxian problem on cycles with an upper bound on the distances of all facilities. We consider the case of p=2 and show that, in the worst case, the optimal solution contains at least one vertex of the underlying cycle, which helps to develop an efficient algorithm to solve the constrained 2-maxian problem. Based on this property, we develop a linear time algorithm for the constrained 2-maxian problem on a cycle. We also discuss the relations between the constrained and unconstrained 2-maxian problems on which the underlying graphs are cycles. Full article
(This article belongs to the Special Issue Operations Research and Optimization, 2nd Edition)
Show Figures

Figure 1

Back to TopTop