176 Hits in 6.9 sec

Revisiting the cluster-based paradigm for implicit search result diversification

Hai-Tao Yu, Adam Jatowt, Roi Blanco, Hideo Joho, Joemon M. Jose, Long Chen, Fajie Yuan
2018 Information Processing & Management  
Moreover, we propose two approaches ILP4ID (Integer Linear Programming for Implicit SRD) and AP4ID (Affinity Propagation for Implicit SRD) for solving the proposed formulation of implicit SRD.  ...  2018) Revisiting the cluster-based paradigm for implicit search result diversification.  ...  The aforementioned drawbacks motivate us to address the task of the implicit SRD in a novel way. In particular, we propose a concise integer linear programming (ILP) formulation for implicit SRD.  ... 
doi:10.1016/j.ipm.2018.03.003 fatcat:hq5ln4f3kfhrvjr735quvvrnnq

Event Digest

Arunav Mishra, Klaus Berberich
2016 Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval - SIGIR '16  
Our method formulates the problem as an Integer Linear Program (ILP) for global inference to diversify across the event dimensions.  ...  For this, in addition to text, a digest should maximize the reportage of time, geolocations, and entities to present a holistic view on the past event of interest.  ...  as an integer linear program (ILP) to perform global inference for the event digest creation.  ... 
doi:10.1145/2911451.2911526 dblp:conf/sigir/MishraB16 fatcat:vxehlab6sfho5nhewgxo2jzpoe

Positive multicriteria (PMC) models in agriculture for energy and environmental policy analysis

Stelios Rozakis
2011 International Journal of Multicriteria Decision Making  
Concrete examples from recent literature illustrate the above statements and ideas for further research are provided.  ...  This paper recalls the development of multi-criteria methods in agriculture, focusing on their contribution to produce input or output functions useful for environmental and/or energy policy.  ...  Mausser and Laguna (1998) used their results to formulate a mixed integer linear program equivalent to CMR which is less complex to solve.  ... 
doi:10.1504/ijmcdm.2011.041192 fatcat:ftzhy6kru5ac7kcpcwze4lmb7e

Efficient Decision Makings for Dynamic Weapon-Target Assignment by Virtual Permutation and Tabu Search Heuristics

Bin Xin, Jie Chen, Juan Zhang, Lihua Dou, Zhihong Peng
2010 IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)  
A generic asset-based DWTA model is established, especially for the warfare scenario of force coordination, to formulate this problem.  ...  for DWTA outperform their competitors in most test cases and they are competent for high-quality real-time DWTA decision makings.  ...  ACKNOWLEDGMENT The authors would like to thank the Editor-in-Chief, Associate Editor, and the anonymous referees for their constructive suggestions and comments on the earlier versions of this paper.  ... 
doi:10.1109/tsmcc.2010.2049261 fatcat:dks3gxqijbbznf7tqcbu5gkbmi

Identity Matrix [chapter]

2013 Encyclopedia of Operations Research and Management Science  
An analysis technique used to analyze a queueing system that is not a continuous-time Markov chain.  ...  It appraises the system at selected time points which allow the system to be analyzed via a discrete-parameter Markov chain.  ...  Operational research for informed innovation: NHS direct as a case study in the design, implementation and evaluation of a New Public Service.  ... 
doi:10.1007/978-1-4419-1153-7_200302 fatcat:ph4et3usavg4zcpkzfp4yz5qlu

The Vehicle Routing Problem with Release and Due Dates

Benjamin C. Shelbourne, Maria Battarra, Chris N. Potts
2017 INFORMS journal on computing  
Examples for a broad range of problem types show that ILS achieves competitive results (see Lourenço et al. 2010) .  ...  Independently of this study, some preliminary results are presented by Cattaruzza et al. (2013) for a multi-trip VRP with hard time windows and release dates.  ...  Acknowledgments The authors thank Thibaut Vidal for a number of helpful comments and explanations about components of his hybrid genetic algorithms.  ... 
doi:10.1287/ijoc.2017.0756 fatcat:tj4jiyjpl5bz3g7uoyt2khtzsu

A New Hyperheuristic Algorithm for Cross-Domain Search Problems [chapter]

Andreas Lehrbaum, Nysret Musliu
2012 Lecture Notes in Computer Science  
The algorithm is structured in different search phases that try to balance intensification and diversification of the search process.  ...  A version of the algorithm was also submitted as a candidate for the Cross-domain Heuristic Search Challenge 2011 organised by the University of Nottingham.  ...  An MEP chromosome usually encodes several different computer programs, leading to a form of implicit parallelism.  ... 
doi:10.1007/978-3-642-34413-8_41 fatcat:pxjtf24yuzb7piptfcbgazab2e

The development and application of metaheuristics for problems in graph theory: a computational study

Sergio Consoli
2011 4OR  
., 1998) , where the problem is solved by using dynamic programming and a geometric algorithm, and in (Weyer-Menkhoff et al., 2005) , where the problem is reformulated as an integer linear programming  ...  For this purpose, a hybrid local search method (HYBRID) is used, in order to improve the diversification of the search process.  ... 
doi:10.1007/s10288-011-0187-3 fatcat:uybenvacn5ebvfaklscfbt52km

Index—Volumes 1–89

1997 Artificial Intelligence  
-1229 Index -Volumes 1-89 /Art@%1 Intelligence 96 (I 997) 3-189 schemes, implicit graph - selective -1340 self-terminating -560 search space 37,46,98,112,115,393,479,574, deeper 1107 for a solution  ...  1374 search 33 1 search strategy 650 strategy 248 tree search 1342 derivable formulas 649 derivation 190 for a solution 15 of a 3D model of a scene 47 8 of rules, automatic -263 strategies  ... 
doi:10.1016/s0004-3702(97)80122-1 fatcat:6az7xycuifaerl7kmv7l3x6rpm

Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem [article]

Toni Pacheco, Rafael Martinelli, Anand Subramanian, Túlio A.M. Toffolo, Thibaut Vidal
2021 arXiv   pre-print
Neighborhood search is a cornerstone of state-of-the-art traveling salesman and vehicle routing metaheuristics.  ...  Moreover, we introduce an exponential-size neighborhood called 2k-Opt, which includes all solutions generated by multiple nested 2-Opts and can be searched in O(n^2) time using dynamic programming.  ...  O'Neil for their prompt answers and detailed results, which were instrumental to complete the numerical comparisons of this paper.  ... 
arXiv:2107.05189v1 fatcat:p4ukbh7inbd7plf6caljmynf6q

Operating room planning and scheduling: solving a surgical case sequencing problem

Brecht Cardoen
2009 4OR  
In Section 5.5.1 we introduce a traditional mixed integer linear programming (MILP) formulation. We refer to this formulation as the basic MILP.  ...  The objective functions are formulated in terms of costs and are optimized using a mixed integer linear programming approach.  ...  Appendix A In this Appendix we derive Expression (5.30 or A-8) from Expression (5.1 or A-1).  ... 
doi:10.1007/s10288-009-0106-z fatcat:fdi65v3de5atbn2eo3hdbuwehe

A scheduling model for the refurbishing process in recycling management

T.C.E. Cheng, B.M.T. Lin, Y. Tian
2013 International Journal of Production Research  
We also develop two metaheuristic algorithms, based on iterated local search and ant colony optimisation, to produce approximate solutions.  ...  The results of computational experiments show that the metaheuristics generate better solutions than the simple weighted shortest processing time dispatching rule, and the NEH-based and CDS-based algorithms  ...  Sevastyanov (the Sobolev Institute of Mathematics, Russia) for discussions on this case.  ... 
doi:10.1080/00207543.2013.842024 fatcat:lokl7kkbzvewhm7ten3tljcvwq

Scalable Text Mining with Sparse Generative Models [article]

Antti Puurula
2016 arXiv   pre-print
The information age has brought a deluge of data. Much of this is in text form, insurmountable in scope for humans and incomprehensible in structure for computers.  ...  order of magnitude decrease in classification times for Wikipedia article categorization with a million classes.  ...  Acknowledgements We'd like to thank Kaggle and the LSHTC organizers for their work in making the competition a success, and the machine learning group at the University of Waikato for the computers we  ... 
arXiv:1602.02332v1 fatcat:2urzib3btveslj5ggie55irxwq

Constraint-based Very Large-Scale Neighborhood search

Sébastien Mouthuy, Pascal Van Hentenryck, Yves Deville
2011 Constraints  
VLSN search algorithms expressed by mean of our framework exhibits several benefits compared to existing approaches: 1) a more natural design of VLSN search algorithm, 2) a better reusability of existing  ...  This thesis aims at remedying this limitation and presents a framework that expresses VLSN search algorithms in terms of high-level components.  ...  The reallocation can also be optimized by Integer Programming [FFT05] .  ... 
doi:10.1007/s10601-011-9114-7 fatcat:mxgk7frp6fg5hb7opxvyyq6psq

Visible Light-Assisted Soft-Chemistry Route to Silver Nanomaterials at Room Temperature

Yi Wu, Xin Liu, Zi Huang, Xiang Fei He, Xi Yang, Qing Li
2019 Key Engineering Materials  
Silver nanoparticles (AgNPs) were synthesizd by a light-assisted liquid phase reduction method with sodium hypophosphite as a reducing agent. DTAB was used to perform as the surfactant.  ...  The result showed that the nanoparticles are spherical and cube. The effect of temperature on the morphology and properties of silver nanoparticles was investigated.  ...  In a second moment, a linearization strategy of the original model was applied and we also used integer linear programming in the resulting formulation.  ... 
doi:10.4028/ fatcat:xara5sxzf5fsvbib2dy6vrl7j4
« Previous Showing results 1 — 15 out of 176 results