Printed from https://ideas.repec.org/s/spr/annopr24.html
Content
September 2012, Volume 198, Issue 1
- 145-164 Gated polling with stationary ergodic walking times, Markovian routing and random feedback
by Dieter Fiems & Eitan Altman - 165-183 Stability of a spatial polling system with greedy myopic service
by Lasse Leskelä & Falk Unger - 185-218 Continuous polling models and application to ferry assisted WLAN
by Veeraruna Kavitha & Eitan Altman
August 2012, Volume 197, Issue 1
- 1-4 Editorial: Multiple criteria decision making and operations research
by Yi Peng & Yong Shi - 5-23 Questionnaire design improvement and missing item scores estimation for rapid and efficient decision making
by Daji Ergu & Gang Kou - 25-45 Functionality defense through diversity: a design framework to multitier systems
by Jingguo Wang & Raj Sharman & Stanley Zionts - 47-70 Improving the computational efficiency in a global formulation (GLIDE) for interactive multiobjective optimization
by Francisco Ruiz & Mariano Luque & Kaisa Miettinen - 71-86 Genetic algorithm-based multi-criteria project portfolio selection
by Lean Yu & Shouyang Wang & Fenghua Wen & Kin Lai - 87-108 An interactive sorting approach based on the assignment examples of multiple decision makers with different priorities
by Fu-Ling Cai & Xiuwu Liao & Kan-Liang Wang - 109-122 Robust optimization analysis for multiple attribute decision making problems with imprecise information
by Jiamin Wang - 123-134 Multiple factor hierarchical clustering algorithm for large scale web page and search engine clickstream data
by Gang Kou & Chunwei Lou - 135-158 Large scale stochastic inventory routing problems with split delivery and service level constraints
by Yugang Yu & Chengbin Chu & Haoxun Chen & Feng Chu - 159-190 Combined DEMATEL technique with hybrid MCDM methods for creating the aspired intelligent global manufacturing & logistics systems
by Gwo-Hshiung Tzeng & Chi-Yo Huang - 191-200 A multiple criteria ranking method based on game cross-evaluation approach
by Jie Wu & Liang Liang - 201-220 Dynamic multiple criteria decision making in changeable spaces: from habitual domains to innovation dynamics
by Po-Lung Yu & Yen-Chu Chen
July 2012, Volume 196, Issue 1
- 1-26 New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
by Michael Andresen & Tanka Dhamala - 27-51 The average tree solution for multi-choice forest games
by S. Béal & A. Lardon & E. Rémila & P. Solal - 53-71 A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
by Andreas Bortfeldt & Sabine Jungmann - 73-90 Monte Carlo hyper-heuristics for examination timetabling
by Edmund Burke & Graham Kendall & Mustafa Mısır & Ender Özcan - 91-109 A Pareto-based search methodology for multi-objective nurse scheduling
by Edmund Burke & Jingpeng Li & Rong Qu - 111-136 A new simulation method based on the RVR principle for the rare event network reliability problem
by H. Cancela & M. Khadiri & G. Rubino - 137-152 Optimal static pricing for a tree network
by Felipe Caro & David Simchi-Levi - 153-165 Trade credit contract with limited liability in the supply chain with budget constraints
by Xiangfeng Chen & Anyu Wang - 167-187 Optimal design of container inspection strategies considering multiple objectives via an evolutionary approach
by Ana Concho & José Ramirez-Marquez - 189-199 Approximately optimal bidding policies for repeated first-price auctions
by Amir Danak & Shie Mannor - 201-222 Overcoming the drawbacks of a revenue-sharing contract through a support program
by Pietro Giovanni & Maria Roselli - 223-240 Bilevel road pricing: theoretical analysis and optimality conditions
by S. Dempe & A. Zemkoho - 241-246 Stability of the multiserver queue with addressed retrials
by G. Falin - 247-261 Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
by Evgeny Gafarov & Alexander Lazarev & Frank Werner - 263-292 Multi-attribute non-expected utility
by Gebhard Geiger - 293-309 Some inference results on random pure exchange economies
by Yongming Hou - 311-331 Fleet replacement under technological shocks
by Natali Hritonenko & Yuri Yatsenko - 333-348 A Bayesian model and numerical algorithm for CBM availability maximization
by Rui Jiang & Michael Kim & Viliam Makis - 349-359 Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect
by Wen-Hung Kuo - 361-369 On minimum sum representations for weighted voting games
by Sascha Kurz - 371-390 A discrete dynamic convexized method for the max-cut problem
by Geng Lin & Wenxing Zhu - 391-410 Stochastic dominance efficiency analysis of diversified portfolios: classification, comparison and refinements
by Andrey Lizyayev - 411-442 Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
by Brian Lunday & Hanif Sherali - 443-458 Rectilinear distance to a facility in the presence of a square barrier
by Masashi Miyagawa - 459-468 Resource allocation for performance improvement
by Nasim Nasrabadi & Akram Dehnokhalaji & Narsis Kiani & Pekka Korhonen & Jyrki Wallenius - 469-490 Location-allocation planning of stockpiles for effective disaster mitigation
by Jomon Paul & Govind Hariharan - 491-516 Scheduling problems with position dependent job processing times: computational complexity results
by Radosław Rudek - 517-541 The one-warehouse multi-retailer problem: reformulation, classification, and computational results
by Oğuz Solyalı & Haldun Süral - 543-579 Maximization of the Choquet integral over a convex set and its application to resource allocation problems
by Mikhail Timonin - 581-590 Solving market split problems with heuristical lattice reduction
by Heiko Vogel - 591-609 A mixed 0–1 LP for index tracking problem with CVaR risk constraints
by Meihua Wang & Chengxian Xu & Fengmin Xu & Hongang Xue - 611-634 Multi-neighborhood tabu search for the maximum weight clique problem
by Qinghua Wu & Jin-Kao Hao & Fred Glover - 635-650 An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
by Tao Wu & Leyuan Shi & Jie Song - 651-662 Convexity of chance constrained programming problems with respect to a new generalized concavity notion
by Zahra Mashayekhi Zadeh & Esmaile Khorram - 663-682 Efficient solutions for the far from most string problem
by Paola Festa & Panos Pardalos - 683-705 Scheduling the adjuvant endocrine therapy for early stage breast cancer
by Sera Kahruman & Elif Ulusal & Sergiy Butenko & Illya Hicks & Kathleen Diehl - 707-735 An analytic framework to develop policies for testing, prevention, and treatment of two-stage contagious diseases
by Hoda Parvin & Piyush Goel & Natarajan Gautam - 737-765 Discrete and geometric Branch and Bound algorithms for medical image registration
by Frank Pfeuffer & Michael Stiglmayr & Kathrin Klamroth - 767-797 Stochastic programming for off-line adaptive radiotherapy
by Mustafa Sir & Marina Epelman & Stephen Pollock - 799-818 Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures
by Z. Taşkın & J. Smith & H. Romeijn - 819-840 Strong valid inequalities for fluence map optimization problem under dose-volume restrictions
by Ali Tuncel & Felisa Preciado & Ronald Rardin & Mark Langer & Jean-Philippe Richard
May 2012, Volume 195, Issue 1
- 1-4 Integrated uncertainty management for decision making
by Van-Nam Huynh & Jonathan Lawry & Yoshiteru Nakamori - 5-31 On some claims related to Choquet integral risk measures
by Hung Nguyen & Uyen Pham & Hien Tran - 33-48 Characterization of a coherent upper conditional prevision as the Choquet integral with respect to its associated Hausdorff outer measure
by Serena Doria - 49-71 Constraint programming for stochastic inventory systems under shortage cost
by Roberto Rossi & S. Tarim & Brahim Hnich & Steven Prestwich - 73-96 Efficient algorithms for heavy-tail analysis under interval uncertainty
by Vladik Kreinovich & Monchaya Chiangpradit & Wararit Panichkitkosolkul - 97-110 Choquet integral for record linkage
by Daniel Abril & Guillermo Navarro-Arribas & Vicenç Torra - 111-134 Normal form backward induction for decision trees with coherent lower previsions
by Nathan Huntley & Matthias Troffaes - 135-161 Evidential reasoning in large partially ordered sets
by Thierry Denœux & Marie-Hélène Masson - 163-187 An introduction and survey of the evidential reasoning approach for multiple criteria decision analysis
by Dong-Ling Xu - 189-220 Qualitative and quantitative data envelopment analysis with interval data
by Masahiro Inuiguchi & Fumiki Mizoshita - 221-236 Different generalizations of bags
by Sadaaki Miyamoto - 237-259 Consistent union and prioritized consistent union: new operations for preference aggregation
by Michaël Rademaker & Bernard De Baets - 261-276 Aggregation functions and generalized convexity in fuzzy optimization and decision making
by Jaroslav Ramík & Milan Vlach - 277-309 A new method for managing the uncertainties in evaluating multi-person multi-criteria location choices, using a perceptual computer
by Shilian Han & Jerry Mendel - 311-323 Information cells and information cell mixture models for concept modelling
by Yongchuan Tang & Jonathan Lawry - 325-354 A group nonadditive multiattribute consumer-oriented Kansei evaluation model with an application to traditional crafts
by Hong-Bin Yan & Van-Nam Huynh & Yoshiteru Nakamori - 355-378 An analytical model for building brand equity in hospitality firms
by Tsuen-Ho Hsu & Li-Chu Hung & Jia-Wei Tang
April 2012, Volume 194, Issue 1
- 1-1 Preface
by Edmund Burke & Michel Gendreau - 3-31 A harmony search algorithm for university course timetabling
by Mohammed Al-Betar & Ahamad Khader - 33-57 Local search neighbourhoods for dealing with a novel nurse rostering model
by Burak Bilgin & Patrick Causmaecker & Benoît Rossie & Greet Vanden Berghe - 59-70 Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
by Alex Bonutti & Fabio Cesco & Luca Gaspero & Andrea Schaerf - 71-87 A branch-and-cut procedure for the Udine Course Timetabling problem
by Edmund Burke & Jakub Mareček & Andrew Parkes & Hana Rudová - 89-109 Linear combinations of heuristics for examination timetabling
by Edmund Burke & Nam Pham & Rong Qu & Jay Yellen - 111-135 Local search and constraint programming for the post enrolment-based course timetabling problem
by Hadrien Cambazard & Emmanuel Hebrard & Barry O’Sullivan & Alexandre Papadopoulos - 137-150 An ILS heuristic for the traveling tournament problem with predefined venues
by Fabrício Costa & Sebastián Urrutia & Celso Ribeiro - 151-166 Designing the master schedule for demand-adaptive transit systems
by Teodor Crainic & Fausto Errico & Federico Malucelli & Maddalena Nonato - 167-176 Towards a reference model for timetabling and rostering
by Patrick De Causmaecker & Greet Vanden Berghe - 177-187 Flight gate scheduling with respect to a reference schedule
by Ulrich Dorndorf & Florian Jaehn & Erwin Pesch - 189-202 Applying the threshold accepting metaheuristic to curriculum based course timetabling
by Martin Geiger - 203-221 An improved multi-staged algorithmic process for the solution of the examination timetabling problem
by Christos Gogos & Panayiotis Alefragis & Efthymios Housos - 223-240 Comparing league formats with respect to match importance in Belgian football
by Dries Goossens & Jeroen Beliën & Frits Spieksma - 241-254 Resource assignment in high school timetabling
by Jeffrey Kingston - 255-272 Curriculum based course timetabling: new solutions to Udine benchmark instances
by Gerald Lach & Marco Lübbecke - 273-289 A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
by Rhyd Lewis - 291-315 A new model for automated examination timetabling
by Barry McCollum & Paul McMullan & Andrew Parkes & Edmund Burke & Rong Qu - 317-324 An approximation algorithm for the traveling tournament problem
by Ryuhei Miyashiro & Tomomi Matsui & Shinji Imahori - 325-339 Solving the post enrolment course timetabling problem by ant colony optimization
by Clemens Nothegger & Alfred Mayer & Andreas Chwatal & Günther Raidl - 341-363 Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
by Tiago Pais & Paula Amaral - 365-384 A comparison of two approaches to nurse rostering problems
by Sanja Petrovic & Greet Berghe - 385-397 An XML format for benchmarks in High School Timetabling
by Gerhard Post & Samad Ahmadi & Sophia Daskalaki & Jeffrey Kingston & Jari Kyngas & Cimmo Nurmi & David Ranson - 399-412 Strong bounds with cut and column generation for class-teacher timetabling
by Haroldo Santos & Eduardo Uchoa & Luiz Ochi & Nelson Maculan - 413-425 An effective greedy heuristic for the Social Golfer Problem
by Markus Triska & Nysret Musliu - 427-438 An improved SAT formulation for the social golfer problem
by Markus Triska & Nysret Musliu - 439-454 An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007
by J. Broek & C. Hurkens
March 2012, Volume 193, Issue 1
- 1-2 Applied mathematical programming and modelling 2008
by Georg Pflug & Ronald Hochreiter - 3-19 Approximation and contamination bounds for probabilistic programs
by Martin Branda & Jitka Dupačová - 21-47 A framework for optimization under ambiguity
by David Wozabal - 49-69 Multivariate value at risk and related topics
by András Prékopa - 71-90 Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution
by Tamás Szántai & Edith Kovács - 91-105 A stochastic model for the daily coordination of pumped storage hydro plants and wind power plants
by Maria Vespucci & Francesca Maggioni & Maria Bertocchi & Mario Innorta - 107-127 A stochastic programming model for the optimal electricity market bid problem with bilateral contracts for thermal and combined cycle units
by F.-Javier Heredia & Marcos Rider & Cristina Corchero - 129-158 Heuristic optimisation in financial modelling
by Manfred Gilli & Enrico Schumann - 159-172 A stochastic programming model for the optimal issuance of government bonds
by Andrea Consiglio & Alessandro Staino - 173-192 HMM based scenario generation for an investment optimisation problem
by Christina Erlwein & Gautam Mitra & Diana Roman - 193-220 Multi-resource allocation in stochastic project scheduling
by Wolfram Wiesemann & Daniel Kuhn & Berç Rustem - 221-253 Stochastic optimization for real time service capacity allocation under random service demand
by Christopher Dance & Alexei Gaivoronski - 255-271 The kidney exchange problem: How hard is it to find a donor?
by Katarína Cechlárová & Vladimír Lacko - 273-289 Complete voting systems with two classes of voters: weightedness and counting
by Josep Freixas & Xavier Molinero & Salvador Roura
January 2012, Volume 192, Issue 1
- 1-2 Foreword
by L. Hong & Xiangtong Qi & Fugee Tsung - 3-19 LASSO-based multivariate linear profile monitoring
by Changliang Zou & Xianghui Ning & Fugee Tsung - 21-47 Transshipment service through crossdocks with both soft and hard time windows
by Zhaowei Miao & Feng Yang & Ke Fu & Dongsheng Xu - 49-66 Fighting strategies in a market with counterfeits
by Jie Zhang & L. Hong & Rachel Zhang - 67-86 On the tour planning problem
by Chenbo Zhu & J. Hu & Fengchun Wang & Yifan Xu & Rongzeng Cao - 87-104 Detection and localization of hidden radioactive sources with spatial statistical method
by Hong Wan & Tonglin Zhang & Yu Zhu - 105-121 A data mining framework for product and service migration analysis
by Siu-Tong Au & Rong Duan & Wei Jiang - 123-140 Robust berth scheduling with uncertain vessel delay and handling time
by Ya Xu & Qiushuang Chen & Xiongwen Quan - 141-150 Preemptive repayment policy for multiple loans
by C. Ng & Q. Ding & T. Cheng & S. Lam - 151-171 Retail service for mixed retail and E-tail channels
by Wei Hu & Yongjian Li
November 2011, Volume 191, Issue 1
- 1-22 An efficient memetic algorithm for the graph partitioning problem
by Philippe Galinier & Zied Boujbel & Michael Coutinho Fernandes - 23-36 Improved complexity results for several multifacility location problems on trees
by Jörg Kalcsics - 37-71 An optimization model and a solution algorithm for the many-to-many car pooling problem
by Shangyao Yan & Chun-Ying Chen - 73-95 Inventory models with ramp type demand rate, time dependent deterioration rate, unit production cost and shortages
by K. Skouri & I. Konstantaras & S. Manna & K. Chaudhuri - 97-113 Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
by Manzhan Gu & Xiwen Lu - 115-135 Value of supplier’s capacity information in a two-echelon supply chain
by İsmail Bakal & Nesim Erkip & Refik Güllü - 137-154 Ensuring the boundedness of the core of games with restricted cooperation
by Michel Grabisch - 155-169 Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
by Ji-Bo Wang & Ming-Zheng Wang - 171-181 Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
by George Steiner & Rui Zhang - 183-192 To lay out or not to lay out?
by Sadegh Niroomand & Szabolcs Takács & Béla Vizvári - 193-218 Controlling job arrivals with processing time windows into Batch Processor Buffer
by John Tajan & Appa Sivakumar & Stanley Gershwin - 219-249 A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty
by André Rossi & Alexis Aubry & Mireille Jacomino - 251-253 A note on the proof of the complexity of the little-preemptive open-shop problem
by Evgeny Shchepin & Nodari Vakhania - 255-262 Existence conditions for generalized vector variational inequalities
by M. Durea & R. Strugariu
October 2011, Volume 190, Issue 1
- 1-2 Editorial
by Lluís Plà-Aragonés & Béla Vizvári - 3-15 Enhanced predictions of wood properties using hybrid models of PCR and PLS with high-dimensional NIR spectral data
by Yi Fang & Jong Park & Young-Seon Jeong & Myong Jeong & Seung Baek & Hyun Cho - 17-39 Forestry management under uncertainty
by Antonio Alonso-Ayuso & Laureano Escudero & Monique Guignard & Martín Quinteros & Andres Weintraub - 41-55 Modeling forest core area with integer programming
by Huizhen Zhang & Miguel Constantino & André Falcão - 57-74 Management of the risk of wind damage in forestry: a graph-based Markov decision process approach
by Nicklas Forsell & Peder Wikström & Frédérick Garcia & Régis Sabbadin & Kristina Blennow & Ljusk Eriksson - 75-92 A multiobjective model for forest planning with adjacency constraints
by T. Gómez & M. Hernández & J. Molina & M. León & E. Aldana & R. Caballero - 93-115 Supply network planning in the forest supply chain with bucking decisions anticipation
by Satyaveer Chauhan & J.-M. Frayret & Luc LeBel - 117-130 Design of insurance contracts using stochastic programming in forestry planning
by Jose Mosquera & Mordecai Henig & Andres Weintraub - 131-148 OR/MS decision support models for the specialty crops industry: a literature review
by Wenbo Zhang & Wilbert Wilhelm - 149-164 A MIP flow model for crop-rotation planning in a context of forest sustainable development
by L. Alfandari & J. Lemalade & A. Nagih & G. Plateau - 165-180 Crop rotation scheduling with adjacency constraints
by Lana dos Santos & Philippe Michelon & Marcos Arenales & Ricardo Santos - 181-199 A goal programming approach for farm planning with resources dimensionality
by M. Ortuño & B. Vitoriano - 201-220 Optimal crop planting schedules and financial hedging strategies under ENSO-based climate forecasts
by Farid AitSahlia & Chung-Jui Wang & Victor Cabrera & Stan Uryasev & Clyde Fraisse - 221-238 Mixed valuation methods: a combined AHP-GP procedure for individual and group multicriteria agricultural valuation
by Jerónimo Aznar & Francisco Guijarro & José Moreno-Jiménez - 239-269 Formulating diets for growing pigs: economic and environmental considerations
by François Dubeau & Pierre-Olivier Julien & Candido Pomar - 271-287 An integer programming model for optimal pork marketing
by Jeffrey Ohlmann & Philip Jones - 289-309 Embedding a state space model into a Markov decision process
by Lars Relund Nielsen & Erik Jørgensen & Søren Højsgaard - 311-323 Risk programming analysis with imperfect information
by Gudbrand Lien & J. Hardaker & Marcel Asseldonk & James Richardson - 325-337 A stochastic programming and simulation based analysis of the structure of production on the arable land
by Béla Vizvári & Zoltán Lakner & Zsolt Csizmadia & Gergely Kovács - 339-358 A tactical model for planning the production and distribution of fresh produce
by Omar Ahumada & J. Villalobos - 359-374 Supply chain models for small agricultural enterprises
by Wooseung Jang & Cerry Klein - 375-387 P2q hierarchical decomposition algorithm for quantile optimization: application to irrigation strategies design
by O. Crespo & J. Bergez & F. Garcia
September 2011, Volume 189, Issue 1
- 1-3 Preface
by Dirk Kroese & Nahum Shimkin & Joseph Kreimer & Sandeep Juneja - 5-23 Efficient simulation of tail probabilities of sums of correlated lognormals
by Søren Asmussen & José Blanchet & Sandeep Juneja & Leonardo Rojas-Nandayapa - 25-42 Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology
by Illana Bendavid & Boaz Golany - 43-61 Rare-event probability estimation with conditional Monte Carlo
by Joshua Chan & Dirk Kroese - 63-102 The design and analysis of a generalized RESTART/DPR algorithm for rare event simulation
by Thomas Dean & Paul Dupuis - 103-125 A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem
by Ali Eshragh & Jerzy Filar & Michael Haythorpe - 127-154 On adaptive stratification
by Pierre Etore & Gersende Fort & Benjamin Jourdain & Eric Moulines - 155-165 Estimating change-points in biological sequences via the cross-entropy method
by G. Evans & G. Sofronov & J. Keith & D. Kroese - 167-185 A combined splitting—cross entropy method for rare-event probability estimation of queueing networks
by M. Garvels - 187-203 Adaptive importance sampling for network growth models
by Adam Guetz & Susan Holmes - 205-214 Cooperative Cross-Entropy method for generating entangled networks
by Kin-Ping Hui - 215-253 An optimal routing policy for unmanned aerial vehicles (analytical and cross-entropy simulation approach)
by Edward Ianovsky & Joseph Kreimer - 255-276 Multilevel Monte Carlo for stochastic differential equations with additive fractional noise
by Peter Kloeden & Andreas Neuenkirch & Raffaella Pavani - 277-297 Approximating zero-variance importance sampling in a reliability setting
by Pierre L’Ecuyer & Bruno Tuffin - 299-329 State-dependent importance sampling for a slowdown tandem queue
by D. Miretskiy & W. Scheinhardt & M. Mandjes - 331-342 Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes
by Shmuel Onn & Ishay Weissman - 343-356 Randomized methods based on new Monte Carlo schemes for control and optimization
by Boris Polyak & Elena Gryazina - 357-388 State-dependent importance sampling schemes via minimum cross-entropy
by Ad Ridder & Thomas Taimre
August 2011, Volume 188, Issue 1
- 1-18 The mathematics of Peter L. Hammer (1936–2006): graphs, optimization, and Boolean models
by Endre Boros & Yves Crama & Dominique Werra & Pierre Hansen & Frédéric Maffray - 19-31 Projecting systems of linear inequalities with binary variables
by Egon Balas - 33-61 Logical analysis of data: classification with justification
by Endre Boros & Yves Crama & Peter Hammer & Toshihide Ibaraki & Alexander Kogan & Kazuhisa Makino - 63-76 The negative cycles polyhedron and hardness of checking some polyhedral properties
by Endre Boros & Khaled Elbassioni & Vladimir Gurvich & Hans Tiwary - 77-110 Analysing DNA microarray data using Boolean techniques
by Ondřej Čepek & David Kronus & Petr Kučera - 111-132 Competitive evaluation of threshold functions in the priced information model
by Ferdinando Cicalese & Martin Milanič - 133-139 The chain graph sandwich problem
by Simone Dantas & Celina Figueiredo & Martin Golumbic & Sulamita Klein & Frédéric Maffray - 141-153 A geometric connection to threshold logic via cubical lattices
by M. Emamy-K - 155-174 A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
by Bissan Ghaddar & Miguel Anjos & Frauke Liers - 175-183 A characterization of chain probe graphs
by Martin Golumbic & Frédéric Maffray & Grégory Morel - 185-213 Reverse-engineering country risk ratings: a combinatorial non-recursive model
by P. Hammer & A. Kogan & M. Lejeune - 215-249 A new column generation algorithm for Logical Analysis of Data
by Pierre Hansen & Christophe Meyer - 251-261 Incremental polynomial time dualization of quadratic functions and a subclass of degree-k functions
by O. Karaşan - 263-278 Relations between threshold and k-interval Boolean functions
by David Kronus - 279-283 Two characterizations of chain partitioned probe graphs
by Van Le - 285-305 Optimization for simulation: LAD accelerator
by Miguel Lejeune & François Margot - 307-329 Edge cover by connected bipartite subgraphs
by Leo Liberti & Laurent Alfandari & Marie-Christine Plateau - 331-341 Stability preserving transformations of graphs
by Vadim Lozin - 343-358 A hybrid ACO-GRASP algorithm for clustering analysis
by Yannis Marinakis & Magdalene Marinaki & Michael Doumpos & Nikolaos Matsatsinis & Constantin Zopounidis - 359-370 Complexity results for equistable graphs and related classes
by Martin Milanič & James Orlin & Gábor Rudolf