Linear programs with an additional separable concave constraint.
Kuno, Takahito, Shi, Jianming (2004)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Kuno, Takahito, Shi, Jianming (2004)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Ignacy Kaliszewski, Stanley Zionts (2004)
Control and Cybernetics
Similarity:
Bojana Lazović, Miroslav Marić, Vladimir Filipović, Aleksandar Savić (2012)
Publications de l'Institut Mathématique
Similarity:
Stanojević, Predrag, Marić, Miroslav, Kratica, Jozef, Bojović, Nebojša, Milenković, Miloš (2010)
Mathematica Balkanica New Series
Similarity:
AMS Subj. Classification: 90C57; 90C10; Rail transportation is very rich in terms of problems that can be modelled and solved using mathematical optimization techniques. The train scheduling problem as the most important part of a rail operating policy has a very significant impact on a rail company profit considering the fact that from the quality of a train timetable depends a flow of three most important resources on rail network: cars, locomotives and crews. The train timetabling...
Hong, Edwin S. (2006)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Matic, Dragan (2012)
Serdica Journal of Computing
Similarity:
This paper presents a Variable neighbourhood search (VNS) approach for solving the Maximum Set Splitting Problem (MSSP). The algorithm forms a system of neighborhoods based on changing the component for an increasing number of elements. An efficient local search procedure swaps the components of pairs of elements and yields a relatively short running time. Numerical experiments are performed on the instances known in the literature: minimum hitting set and Steiner triple systems. Computational...
Adlakha, V., Arsham, H. (1998)
Journal of Applied Mathematics and Decision Sciences
Similarity:
José Luis Quintero, Alejandro Crema (2005)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The multiparametric min max 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of min max 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to the objective function.
Jaroslav Hrouda (1976)
Aplikace matematiky
Similarity: