Página principal > Resultados de la búsqueda: Combinatorial optimization
  Consejos para la búsqueda
Búsqueda avanzada
Buscar colecciones:
Ordenar por: Mostrar resultados: Formato de visualización:
Resultados globales: 9 registros encontrados en 0.02 segundos.
Artículos, Encontrados 7 registros
Documentos de investigación, Encontrados 2 registros
Artículos Encontrados 7 registros  
1.
24 p, 263.5 KB Why simheuristics? : Benefits, limitations, and best practices when combining metaheuristics with simulation / Chica, Manuel (Universidad de Granada) ; Juan, Ángel A. (Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3)) ; Bayliss, Christopher (Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3)) ; Cordón, Oscar (Universidad de Granada) ; Kelton, W. David (University of Cincinnati. Department of Operations)
Many decision-making processes in our society involve NP-hard optimization problems. The largescale, dynamism, and uncertainty of these problems constrain the potential use of stand-alone optimization methods. [...]
2020 - 10.2436/20.8080.02.104
SORT : statistics and operations research transactions, Vol. 44 Núm. 2 (July-December 2020) , p. 311-334 (Articles)  
Registro completo - Creative Commons
2.
22 p, 1.0 MB Horizontal collaboration in freight transport : concepts, benefits and environmental challenges / Serrano-Hernández, Adrián (Universidad Pública de Navarra. Departamento de Estadística, Informática y Matemáticas) ; Juan, Ángel A. (Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3)) ; Faulin, Javier (Universidad Pública de Navarra. Departamento de Estadística, Informática y Matemáticas) ; Perez-Bernabeu, Elena (Universitat Politècnica de València. Departament d'Estadísitica i Investigació Operativa aplicades i Qualitat)
Since its appearance in the 1990s, horizontal collaboration (HC) practices have revealed themselves as catalyzers for optimizing the distribution of goods in freight transport logistics. After introducing the main concepts related to HC, this paper offers a literature review on the topic and provides a classification of best practices in HC. [...]
2017 - 10.2436/20.8080.02.65
SORT : statistics and operations research transactions, Vol. 41 Núm. 2 (July-December 2017) , p. 393-414 (Articles)  
Registro completo - Creative Commons
3.
24 p, 266.8 KB A mathematical programming approach for different scenarios of bilateral bartering / Nasini, Stefano (Universitat Politècnica de Catalunya) ; Castro, Jordi (Universitat Politècnica de Catalunya) ; Fonseca, Pau (Universitat Politècnica de Catalunya)
The analysis of markets with indivisible goods and fixed exogenous prices has played an important role in economic models, especially in relation to wage rigidity and unemployment. This paper provides a novel mathematical programming based approach to study pure exchange economies where discrete amounts of commodities are exchanged at fixed prices. [...]
2015
SORT : statistics and operations research transactions, Vol. 39 Núm. 1 (January-June 2015) , p. 85-108 (Articles)  
Registro completo - Creative Commons
4.
59 p, 2.2 MB Discrete convex analysis / Murota, Kazuo
A theory of "discrete convex analysis" is developed for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, subgradients, the Fenchel min-max duality, separation theorems and the Lagrange duality framework for convex/nonconvex optimization. [...]
1998
Mathematical Programming, vol. 83 n. 3 (1998) p. 313-371  
 Acceso restringido a la UAB
Registro completo -
5.
30 p, 1.8 MB Discrete optimization in public rail transport / Bussieck, M. R. ; Winter, T. ; Zimmermann, U. T.
Many problems arising in traffic planning can be modelled and solved using discrete optimization. We will focus on recent developments which were applied to large scale real world instances. Most railroad companies apply a hierarchically structured planning process. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 415-444  
 Acceso restringido a la UAB
Registro completo -
6.
19 p, 1.1 MB Semidefinite programming in combinatorial optimization / Goemans, Michel X.
We discuss the use of semidefinite programming for combinatorial optimization problems. The main topics covered include (i) the Lovász theta function and its applications to stable sets, perfect graphs, and coding theory, (ii) the automatic generation of strong valid inequalities, (iii) the maximum cut problem and related problems, and (iv) the embedding of finite metric spaces and its relationship to the sparsest cut problem. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 143-161  
 Acceso restringido a la UAB
Registro completo -
7.
21 p, 1.1 MB Measure concentration in optimization / Barvinok, Alexander
We discuss some consequences of the measure concentration phenomenon for optimization and computational problems. Topics include average case analysis in optimization, efficient approximate counting, computation of mixed discriminants and permanents, and semidefinite relaxation in quadratic programming. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 33-53  
 Acceso restringido a la UAB
Registro completo -

Documentos de investigación Encontrados 2 registros  
1.
16 p, 707.4 KB Automated Name Selection for the Network Scale-Up Method / Fenoy, Adrià (Universitat Autònoma de Barcelona. Departament d'Antropologia Social i Cultural) ; Bojanowski, Michał (Kozminski University (Polònia)) ; Lubbers, Miranda J. (Universitat Autònoma de Barcelona. Departament d'Antropologia Social i Cultural)
The distribution of the number of acquaintances among members of a society is a relevant feature of its social structure. Furthermore, the number of acquaintances (or "degree") is used for estimating other societal features, such as the size of hard-to-count subpopulations or social cohesion. [...]
- 10.31235/osf.io/t6pk2  
Registro completo - Creative Commons
2.
4.0 MB An Algorithmic Framework for Making Use of Negative Learning in Ant Colony Optimization / Nurcahyadi, Teddy ; Blum, Christian Clemens, dir. ; Maña Serres, Felipe, dir.
L'optimització amb colònies de formigues (ACO) és una metaheurística que s'inspira en la naturalesa. ACO explota la capacitat que tenen les formigues per a trobar rutes curtes, entre el formiguer i la font d'aliments, utilitzant dos mecanismes: la construcció de solucions i l'actualització de feromones. [...]
La Optimización con colonias de hormigas (ACO) es una metaheurística inspirada en la naturaleza. ACO explota la capacidad que tienen las hormigas para encontrar rutas cortas, entre el hormiguero y la fuente de alimentos, utilizando dos mecanismos: la construcción de soluciones y la actualización de feromonas. [...]
Ant Colony Optimization (ACO) is a metaheuristic that took its inspiration from nature. This algorithm imitates the ants' capability in finding short routes between their nest and food sources by using two mechanisms: solution construction and pheromone update. [...]
2022  
Registro completo -

¿Le interesa recibir alertas sobre nuevos resultados de esta búsqueda?
Defina una alerta personal vía correo electrónico o subscríbase al canal RSS.
Depósito Digital de Documentos de la UAB :: Buscar :: Enviar :: Personalizar :: Ayuda
Powered by Invenio v1.1.6
Mantenido por ddd.bib@uab.cat  :: Metadatos sujetos a:
Colaboramos