Printed from https://ideas.repec.org/s/spr/topjnl4.html
Content
December 2008, Volume 16, Issue 2
- 345-366 Optimizing logistic regression coefficients for discrimination and calibration using estimation of distribution algorithms
by V. Robles & C. Bielza & P. Larrañaga & S. González & L. Ohno-Machado - 367-387 A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
by José Fernández & Boglárka Tóth & Lázaro Cánovas & Blas Pelegrín - 388-406 On the convergence of the Weiszfeld algorithm for continuous single facility location–allocation problems
by Frank Plastria & Mohamed Elosmani
July 2008, Volume 16, Issue 1
- 1-41 Transversality of the Shapley value
by Stefano Moretti & Fioravante Patrone - 42-43 Comments on: Transversality of the Shapley value
by V. Fragnelli - 44-47 Comments on: Transversality of the Shapley value
by Michel Grabisch - 48-50 Comments on: Transversality of the Shapley value
by Claus-Jochen Haake - 51-53 Comments on: Transversality of the Shapley value
by Ignacio García-Jurado - 54-57 Comments on: Transversality of the Shapley value
by Joaquín Sánchez-Soriano - 58-59 Comments on: Transversality of the Shapley value
by Stef Tijs - 60-61 Rejoinder on: Transversality of the Shapley value
by Stefano Moretti & Fioravante Patrone - 62-72 Reliability formula & limit law of the failure time of “m-consecutive-k-out-of-n:F system”
by Namir Ghoraf - 73-89 Potential, value, and coalition formation
by Annick Laruelle & Federico Valenciano - 90-113 ℱlow $\mathcal{S}$ ort: a flow-based sorting method with limiting or central profiles
by Philippe Nemery & Claude Lamboray - 114-125 Improved algorithms for the multicut and multiflow problems in rooted trees
by A. Tamir - 126-146 A filter inexact-restoration method for nonlinear programming
by Cândida Silva & M. Monteiro - 147-163 Characterizations of optimal solution sets of convex infinite programs
by T. Son & N. Dinh - 164-194 The single facility location problem with average-distances
by C. Valero Franco & A. Rodríguez-Chía & I. Espejo Miranda - 195-213 Joint optimization of price and order quantity with shortages for a two-warehouse system
by Chandra Jaggi & Priyanka Verma
December 2007, Volume 15, Issue 2
- 161-198 Dynamic priority allocation via restless bandit marginal productivity indices
by José Niño-Mora - 199-201 Comments on: Dynamic priority allocation via restless bandit marginal productivity indices
by I. Adan & O. Boxma - 202-207 Comments on: Dynamic priority allocation via restless bandit marginal productivity indices
by Eitan Altman - 208-210 Comments on: Dynamic priority allocation via restless bandit marginal productivity indices
by Onésimo Hernández-Lerma - 211-216 Comments on: Dynamic priority allocation via restless bandit marginal productivity indices
by Richard Weber - 217-219 Comments on: Dynamic priority allocation via restless bandit marginal productivity indices
by Peter Whittle - 220-223 Comments on: Dynamic priority allocation via restless bandit marginal productivity indices
by David Yao - 224-230 Rejoinder on: Dynamic priority allocation via restless bandit marginal productivity indices
by José Niño-Mora - 231-241 An extension to rapid transit network design problem
by Ángel Marín - 242-255 Minimal large sets for cooperative games
by F. Martínez-de-Albéniz & Carles Rafels - 256-280 The class of microarray games and the relevance index for genes
by Stefano Moretti & Fioravante Patrone & Stefano Bonassi - 281-296 Nonhomogeneous geometric distributions with relations to birth and death processes
by Marvin Mandelbaum & Myron Hlynka & Percy Brill - 297-306 A taxonomy of best-reply multifunctions in 2×2×2 trimatrix games
by Carlos González-Alcón & Peter Borm & Ruud Hendrickx & Kim Kuijk - 307-321 Advertising coordination games of a manufacturer and a retailer while introducing a new product
by Alessandra Buratto & Luca Grosset & Bruno Viscolani - 322-340 p-additive games: a class of totally balanced games arising from inventory situations with temporary discounts
by Ana Meca & Luis Guardiola & Andrés Toledo - 341-354 Proportional share analysis
by Carles Rafels & Cori Vilella - 355-371 Closed formulas in local sensitivity analysis for some classes of linear and non-linear problems
by E. Castillo & A. Conejo & C. Castillo & R. Mínguez - 372-382 Computational experiments with a lazy version of a K quickest simple path ranking algorithm
by M. Pascoal & M. Captivo & J. Clímaco
July 2007, Volume 15, Issue 1
- 1-31 Static pickup and delivery problems: a classification scheme and survey
by Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte - 32-34 Comments on: Static pickup and delivery problems: a classification scheme and survey
by S. Anily - 35-36 Comments on: Static pickup and delivery problems: a classification scheme and survey
by Angel Corberán - 37-40 Comments on: Static pickup and delivery problems: a classification scheme and survey
by Roberto Galvão - 41-42 Comments on: Static pickup and delivery problems: a classification scheme and survey
by Harilaos Psaraftis - 43-44 Comments on: Static pickup and delivery problems: a classification scheme and survey
by Daniele Vigo - 45-47 Rejoinder on: Static pickup and delivery problems: a classification scheme and survey
by Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte - 48-64 The value of the stochastic solution in multistage problems
by Laureano Escudero & Araceli Garín & María Merino & Gloria Pérez - 65-77 On generalized semi-infinite optimization of genetic networks
by Gerhard-Wilhelm Weber & Aysun Tezel - 78-88 Type monotonic allocation schemes for a class of market games
by Rodica Brânzei & Tamás Solymosi & Stef Tijs - 89-102 A consumption model with separability and imperfect decision makers
by José Gutiérrez - 103-113 Some results on quasipolyhedral convexity
by M. Fajardo & M. López - 114-137 An algorithm for a fuzzy transportation problem to select a new type of coal for a steel manufacturing unit
by Pankaj Gupta & Mukesh Mehlawat - 138-145 Multicriteria games and potentials
by Fioravante Patrone & Lucia Pusillo & Stef Tijs - 146-160 Analyzing the finite buffer batch arrival queue under Markovian service process: GI X /MSP/1/N
by A. Banik & U. Gupta
June 2006, Volume 14, Issue 1
- 1-32 On generalized semi-infinite programming
by Jan Rückmann & Juan Alfredo Gómez - 61-73 The least square values and the shapley value for cooperative TU games
by Irinel Dragan - 75-98 On the role of chance moves and information in two-person games
by Marcel Dreef & Peter Borm - 99-111 Another potential shortcoming of AHP
by Joaquín Pérez & José Jimeno & Ethel Mokotoff - 113-134 A duopolistic spatial competition model with non-zero conjectural variation
by P. Dorta-González & D. Santos-Peñate & R. Suárez-Vega - 135-166 Input, output and graph technical efficiency measures on non-convex FDH models with various scaling laws: An integrated approach based upon implicit enumeration algorithms
by Walter Briec & Kristiaan Kerstens - 167-176 A note on theβ-measure for digraph competitions
by Marieke Quant & Peter Borm & Hans Reijnierse & Mark Voorneveld
December 2005, Volume 13, Issue 2
- 185-279 Generalized derivatives and nonsmooth optimization, a finite dimensional tour
by Joydeep Dutta - 315-320 Two new examples of sets without medians and centers
by Pier Papini - 321-329 Separating the solution sets of analytical and polynomial systems
by Miguel Goberna & Lidia Hernández & Maxim Todorov - 331-341 Monotonicity properties of the nucleolus on the domain of veto balanced games
by J. Arin & V. Feltkamp - 343-357 Duality and saddle-points for convex-like vector optimization problems on real linear spaces
by Miguel Adán & Vicente Novo - 359-412 Optimal design and control of queues
by Lotfi Tadj & Gautam Choudhury
June 2005, Volume 13, Issue 1
- 1-56 Towards a unified territorial design approach — Applications, algorithms and GIS integration
by Jörg Kalcsics & Stefan Nickel & Michael Schröder - 75-103 The queue length distributions in the finite buffer bulk-service MAP/G/1 queue with multiple vacations
by K. Sikdar & U. Gupta - 105-126 Thep-facility ordered median problem on networks
by A. Rodríguez-Chía & J. Puerto & D. Pérez-Brito & J. Moreno - 127-143 Necessary optimality conditions and saddle points for approximate optimization in banach spaces
by J. Dutta - 145-166 A primal-dual interior-point algorithm for nonlinear least squares constrained problems
by M. Fernanda & P. Costa & Edite Fernandes - 167-184 Uniform saturation in linear inequality systems
by Miguel Goberna & Valentín Jornet & Mariola Molina
December 2004, Volume 12, Issue 2
- 209-275 On self-regular IPMs
by Maziar Salahi & Renata Sotirov & Tamás Terlaky - 301-330 Two level hierarchical time minimizing transportation problem
by Sonia & Munish Puri - 331-350 The core and related solution concepts for infinite assignment games
by Natividad Llorca & Joaquín Sánchez-Soriano & Stef Tijs & Judith Timmer - 351-374 On price competition in location-price models with spatially separated markets
by María Pérez & Pascual Hernández & Blas Pelegrín - 375-398 Queues with postponed work
by T. Deepak & V. Joshua & A. Krishnamoorthy - 399-408 Various characterizations of convex fuzzy games
by Stef Tijs & Rodica Brânzei - 409-423 Finding economic order quantities with nonlinear goal programming
by Dinesh Sharma & Debasis Ghosh & Dorothy Mattison
June 2004, Volume 12, Issue 1
- 1-63 Approximative solution methods for multiobjective combinatorial optimization
by Matthias Ehrgott & Xavier Gandibleux - 91-110 Performance analysis of a call center with interactive voice response units
by Raj Srinivasan & Jérome Talim & Jinting Wang - 111-133 Discretization and resolution of the (r|X p )-medianoid problem involving quality criteria
by R. Suárez-Vega & D. Santos-Peñate & P. Dorta-González - 135-147 Characterization of the feasible set mapping in one class of semi-infinite optimization problems
by Estela Juárez & Maxim Todorov - 149-167 Advertising for a new product introduction: A stochastic approach
by Luca Grosset & Bruno Viscolani - 169-191 Branch and win: OR tree search algorithms for solving combinatorial optimisation problems
by Rafael Pastor & Albert Corominas - 193-208 Predictive control of periodic-review production inventory systems with deteriorating items
by R. Hedjar & M. Bounkhel & L. Tadj
December 2003, Volume 11, Issue 2
- 151-200 Lagrangean relaxation
by Monique Guignard - 229-251 Modelling, making inferences and making decisions: The roles of sensitivity analysis
by Simon French - 253-274 An EOQ model with backorders and all-units discounts
by L. San José & J. García-Laguna - 275-283 Fast formula of a reliability ofm-consecutive-k-out-of-n:F system with cyclek
by N. Ghoraf & M. Boushaba - 285-310 A queueing system with linear repeated attempts, bernoulli schedule and feedback
by I. Atencia & P. Moreno - 311-324 On a compromise social choice correspondence
by Marieke Quant & Peter Borm & Hans Reijnierse & Mark Voorneveld - 325-336 Routing relatively few customers per route
by Wout Dullaert & Olli Bräysy
June 2003, Volume 11, Issue 1
- 1-75 Unsupervised and supervised data classification via nonsmooth and global optimization
by A. Bagirov & A. Rubinov & N. Soukhoroukova & J. Yearwood - 95-107 L-Matrices and solvability of linear complementarity problems by a linear program-Matrices and solvability of linear complementarity problems by a linear program
by Fengmei Yang & Shouyang Wang & Mei Yu & Luis Coladas - 109-130 A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
by A. Vaz & Edite Fernandes & M. Gomes - 131-140 On simulating arbitrary events
by Marcel Neuts & Jun Guo - 141-150 Some aspects of anM/G/1 queueing system with optional second service
by Gautam Choudhury
December 2002, Volume 10, Issue 2
- 147-185 Discrete time queues and matrix-analytic methods
by Attahiru Alfa - 211-237 Tabu Search heuristics for the Vehicle Routing Problem with Time Windows
by Olli Bräysy & Michel Gendreau - 239-259 A tabu search algorithm for assigning teachers to courses
by Ramón Alvarez-Valdés & Francisco Parreño & José Tamarit - 261-273 Sustainability in bankruptcy problems
by Carmen Herrero & Antonio Villar - 275-287 Folk theorems in multicriteria repeated N-person games
by L. Petrosjan & J. Puerto - 289-324 Stochastic measures of arbitrage
by Alejandro Balbás & María Muñoz-Bouzo - 325-336 An approximation of feasible sets in semi-infinite optimization
by Francisco Vázquez & Jan-J. Rückmann
June 2002, Volume 10, Issue 1
- 1-30 Numerical treatment of an asset price model with non-stochastic uncertainty
by R. Tichatschke & A. Kaplan & T. Voetmann & M. Böhm - 51-66 Approximation of multiserver retrial queues by means of generalized truncated models
by Vladimir Anisimov & Jesus Artalejo - 67-81 Theτ-value for games on matroids
by J. Bilbao & A. Jiménez-Losada & E. Lebrón & S. Tijs - 83-99 Connection problems in mountains and monotonic allocation schemes
by Stefano Moretti & Henk Norde & Kim Pham Do & Stef Tijs - 101-123 Analysis and comparisons of some solution concepts for stochastic programming problems
by R. Caballero & E. Cerda & M. Muñoz & L. Rey - 125-145 On the solution of NP-hard linear complementarity problems
by Joaquim Júdice & Ana Faustino & Isabel Ribeiro
December 2001, Volume 9, Issue 2
- 139-199 Operations research games: A survey
by Peter Borm & Herbert Hamers & Ruud Hendrickx - 217-242 On the choice of aggregation points for continuousp-median problems: A case for the gravity centre
by Frank Plastria - 243-269 List scheduling algorithms to minimize the makespan on identical parallel machines
by Ethel Mokotoff & José Jimeno & Ana Gutiérrez - 271-280 Location and sizing of facilities on a line
by Jack Brimberg & Abraham Mehrez - 281-291 On the coherence function for stochastic systems
by Nuria Ruiz-Fuentes & Juan Ruiz-Molina & Mariano Valderrama - 293-314 The lagrange approach to infinite linear programs
by J. Gabriel & Raquiel López-Martínez & Onésimo Hernández-Lerma
June 2001, Volume 9, Issue 1
- 1-22 Mathematical programming and electricity markets
by Antonio Conejo & Francisco Prieto - 55-67 Weighted shapley values for games in generalized characteristic function form
by Gustavo Bergantiños & Estela Sánchez - 69-75 A potential approach for ordinal games
by Henk Norde & Fioravante Patrone - 77-89 Industrial petrochemical production planning and expansion: A multi-objective linear programming approach
by Carlos Escobar-Toledo - 91-114 On a relative measure of skill for games with chance elements
by Peter Borm & Ben Genugten - 115-138 Extreme points of discrete location polyhedra
by Lázaro Cánovas & Alfredo Marín & Mercedes Landete
December 2000, Volume 8, Issue 2
- 165-190 The stochastic generalised assignment problem with Bernoulli demands
by Maria Albareda-Sambola & Elena Fernández - 191-213 Generating functions for computing power indices efficiently
by J. Bilbao & J. Fernández & A. Losada & J. López - 215-234 Comparison of α-Condorcet points with median and center locations
by Clara Rodríguez & José Pérez - 235-263 A generalized additive, categorical model in data envelopment analysis
by Luka Neralić & Richard Wendell - 265-285 The generalizedp-Centdian on network
by Dionisio Brito & José Moreno Pérez - 287-309 Local optimality subsets and global optimization a prospective approach
by Alain Quilliot - 311-326 Rationalizations of choice functions
by Ma Isabel Rodríguez-Galiano - 327-337 A note for tightening 0–1 models
by Laureano Escudero & Susana Muñoz
June 2000, Volume 8, Issue 1
- 1-30 Coalitional values for cooperative games withr alternatives
by M. Albizuri & José Zarzuelo - 31-41 Implementation of the τ-value
by Gustavo Bergantiños & Luciano Méndez-Naya - 43-55 Simple games on closure spaces
by J. Bilbao & E. Lebrón & N. Jiménez - 57-71 A real delivery problem dealt with Monte Carlo Techniques
by P. Córdoba & L. García-Raffi & A. Mayado & J. Sanchis - 73-96 Multicommodity long-term hydrogeneration optimization with capacity and energy constraints
by José González & Narcís Nabona - 97-110 Multiobjective fractional programming with generalized convexity
by R. Osuna-Gómez & A. Rufián-Lizana & P. Ruíz-Canales - 111-134 Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
by Rafael Pastor & Albert Corominas - 135-162 An algorithmic study of the Maximum Flow problem: A comparative statistical analysis
by A. Sedeño-Noda & M. González-Sierra & C. González-Martín - 163-164 Corrections to “Queueing analysis of a sequential recognizer of patterns”
by A. Aissani & J. Asselin de Beauville
December 1999, Volume 7, Issue 2
- 1-1 Preface
by Jesús Artalejo - 169-186 Switching stochastic models and applications in retrial queues
by Vladimir Anisimov - 187-211 A classified bibliography of research on retrial queues: Progress in 1990–1999
by J. Artalejo - 213-220 AnM/M/c queue with impatient customers
by Nam Boots & Henk Tijms - 221-229 Asymptotical properties of erlang queueing systems with a dependent Poisson input flow
by Alexander Chechelnitski - 231-248 MAP 1 , MAP 2 /M/c retrial queue with guard channels and its application to cellular networks
by Bong Choi & Yong Chang & Bara Kim - 249-266 Matrix analytic methods for a multi-server retrial queue with buffer
by Jeffrey Diamond & Attahiru Alfa - 267-278 BMAP|SM⥻1 model with Markov modulated retrials
by A. Dudin & V. Klimenok - 279-291 Heavy traffic analysis of M/G/1 type queueing systems with Markov-modulated arrivals
by Gennadi Falin & Anatoli Falin - 293-304 Reliability of ak-out-of-n system with repair and retrial of failed units
by A. Krishnamoorthy & P. Ushakumari - 305-322 Markovian polling systems with mixed service disciplines and retrial customers
by Christos Langaris - 323-332 On queuing systems with failures and several types of input flows
by Eugene Lebedev & Oleg Ponomarchuk - 333-350 The infinite server queue and heuristic approximations to the multi-server queue with and without retrials
by M. Ramalhoto - 351-353 Retrial queues
by J. Templeton
June 1999, Volume 7, Issue 1
- 1-23 Analytical solution for a class of learning by doing models with multiplicative uncertainty
by Francisco Álvarez & Emilio Cerdá - 25-31 Note on an improved branch-and-bound algorithm to solve n/m/P/F max problems
by Ramón Companys - 33-70 Extensions of Dinkelbach's algorithm for solving non-linear fractional programming problems
by Ricardo Ródenas & M. López & Doroteo Verastegui - 71-80 An algorithm for computing the stable coalition structures in tree-graph communication games
by Fritz Grafe & Elena Inarra & Ana Mauleon - 81-101 A generalized Malmquist productivity index
by E. Grifell-Tatjé & C. Lovell - 103-121 Locally Farkas-Minkowski linear inequality systems
by Rubén Puente & Virginia Vera de Serio - 123-143 The stochastic bottleneck linear programming problem
by I. Stancu-Minasian & R. Caballero & E. Cerdá & M. Muñoz - 145-153 On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint
by Laureano Escudero & Araceli Garín & Gloria Pérez - 155-161 On surrogating 0–1 knapsack constraints
by Laureano Escudero & M. Martínez & M. Ortuño - 163-168 On the consistency of the Banzhaf semivalue
by Luis Ruiz
December 1998, Volume 6, Issue 2
- 1-1 Preface
by Blas Pelegrín - 159-177 Location of rectilinear center trajectories
by J. Díaz-Báñez & J. Mesa - 179-194 Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
by Emilio Carrizosa & Frank Plastria - 195-204 A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem
by Justo Puerto & R. Fernández - 205-221 Efficient solution methods for covering tree problems
by T. Boffey - 223-246 Location of paths on trees with minimal eccentricity and superior section
by Pascual Fernández & Blas Pelegrín & José Fernández - 247-260 Discretization results for the Huff and Pareto-Huff competitive location models on networks
by Peter Peeters & Frank Plastria - 261-275 The many-to-many location-routing problem
by G. Nagy & S. Salhi - 277-286 Solving the plant location problem on a line by linear programming
by Jack Brimberg & Charles ReVelle - 287-311 A methodology for modelling travel distances by Bias estimation
by Francisco Ortega & Juan Mesa - 313-319 Maximin location: Discretization not always works
by Isabel Alonso & Emilio Carrizosa & Eduardo Conde
June 1998, Volume 6, Issue 1
- 1-18 A multi-local optimization algorithm
by Teresa León & Susana Sanmatías & Enriqueta Vercher - 19-36 0–1 equivalent model representations for air traffic management
by Antonio Alonso & Laureano Escudero - 45-66 Queuing analysis of a sequential recognizer of patterns
by A. Aissani & J. Beauville - 67-95 Detecting embedded pure network structures in LP problems
by Nalân Gülpinar & Gautam Mitra & Istvan Maros - 97-121 Sensitivity analysis in A class of dynamic optimization models
by Jesús Antón & Emilio Cerdá & Elena Huergo - 123-138 Searching for a strong double tracing in a graph
by Enrique López & David Fernández - 139-158 Some new results on least square values for TU games
by Luis Ruiz & Federico Valenciano & José Zarzuelo
December 1997, Volume 5, Issue 2
- 167-186 Towards a constructive approach to act-conditional subjective expected utility models
by Zhigang Xie & Simon French - 187-199 The biobjective absolute center problem
by Rosa Ramos & Joaquín Sicilia & Teresa Ramos - 201-211 Different ways to represent weighted majority games
by J. Freixas - 213-219 A comparison of algorithm RS with algorithm OPTSOL70
by Marc Almiñana & Jesús Pastor - 221-239 Modelling and solving the production rate variation problem (PRVP)
by Joaquín Bautista & Ramon Companys & Albert Corominas - 253-281 The Hierarchical compromise programming
by María Escobar & José Moreno-Jiménez - 283-296 A tabu search algorithm for the Open Shop problem
by David Alcaide & Joaquín Sicilia & Daniele Vigo - 297-305 Probabilistic order level system with lead time when delay in payments are permissible
by Nita Shah - 307-311 A necessary and sufficient condition to a pareto optimal without optimizing the weighting criterion
by M. Sánchez & M. Sobrón
June 1997, Volume 5, Issue 1
- 1-40 A survey of some mathematical programming models in transportation
by Jaume Barceló - 41-59 Solving large set covering problems for crew scheduling
by Ferdinando Pezzella & Enrico Faggioli - 61-80 A few practical problems on the application of OD-estimation in motorway networks
by Yong Zhou & Thomas Sachse - 81-93 Traffic queue estimation
by Jean-Louis Gallego & Jean-Loup Farges & Jean-Jacques Henry - 95-104 Assessing the efficiency of rapid transit configurations
by Gilbert Laporte & Juan Mesa & Francisco Ortega - 105-126 The two-convex-polygons TSP: A solvable case
by Alfredo García & F. Tejel - 127-142 Linearity criterion for the selection of an optimal tree
by Arantza Rio & Francisco Cano Sevilla & Antonio Prados - 143-157 On the optimal control of stochastic linear systems with contaminated partial observations
by Rosario Romera