2020
DOI: 10.1088/1742-6596/1490/1/012063
|View full text |Cite
|
Sign up to set email alerts
|

A random search method for finding ‘K ≥ 2’ number of ranked optimal solution to an assignment problem

Abstract: A need for an optimal solution for a given mathematical model is well known and many solution approaches have been developed to identify efficiently an optimal solution for a given situation. For example, one such class of mathematical models with industrial applications have been classified as mathematical programming models (MPM). The main idea behind these models is to find the optimal solution described by those models and interpret the solution back with respect to the given industrial situation. However,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…We also identified why the CE approach is not applicable to special LPs like an assignment and transportation models. Ranked optimal solutions have been discussed in Kumar et al (2018Kumar et al ( , 2020, Murty (1968) and some ideas on information recycle discussed by Kumar (2005Kumar ( , 2006) may be of value for extending existing optimization approaches to find ranked-optimal solutions. These ideas will be attempted in a subsequent publication.…”
Section: Discussionmentioning
confidence: 99%
“…We also identified why the CE approach is not applicable to special LPs like an assignment and transportation models. Ranked optimal solutions have been discussed in Kumar et al (2018Kumar et al ( , 2020, Murty (1968) and some ideas on information recycle discussed by Kumar (2005Kumar ( , 2006) may be of value for extending existing optimization approaches to find ranked-optimal solutions. These ideas will be attempted in a subsequent publication.…”
Section: Discussionmentioning
confidence: 99%
“…EMU, HiFi, MuSR) or the long axis (e.g. ARGUS, CHRONUS, D1 [8], ARTEMIS [9]). Positrons passing through the short axis of the scintillator require a positron degrader to optimise the product of the counting rate and the square of the signal asymmetry (RA 2 ).…”
Section: Monte Carlo Modelling Of Spectrometer Designsmentioning
confidence: 99%
“…This is one of the main reasons why µ − SR has been exploited much less intensively than µ + SR. However, due to the intense pulsed muon sources at ISIS and J-PARC and the development of a multi-detector counting system [1] there has been a recent revival of µ − SR experiments, particularly in the study of hydrogen storage and battery materials [2,3]. When stopped in a material of atomic number Z, µ − forms a muonic atom and cascades down to its ground state.…”
Section: Introductionmentioning
confidence: 99%