Filters








30,913 Hits in 9.9 sec

A Global Constraint for the Exact Cover Problem: Application to Conceptual Clustering

Maxime Chabert, Christine Solnon
2020 The Journal of Artificial Intelligence Research  
We introduce the exactCover global constraint dedicated to the exact cover problem, the goal of which is to select subsets such that each element of a given set belongs to exactly one selected subset.  ...  This NP-complete problem occurs in many applications, and we more particularly focus on a conceptual clustering application.  ...  We also thank Ian Davidson for an enriching discussion on clustering problems and their relation with exact cover problems.  ... 
doi:10.1613/jair.1.11870 fatcat:udml6wh4wfhnblzfn4wzsnmhzi

Text Summarization Model based on Maximum Coverage Problem and its Variant

Hiroya Takamura, Manabu Okumura
2008 Transactions of the Japanese society for artificial intelligence  
On the basis of the results of comparative experiments, we also augment the summarization model so that it takes into account the relevance to the document cluster.  ...  We discuss text summarization in terms of maximum coverage problem and its variant.  ...  Such a set of multiple documents is called a document cluster. The method proposed in this paper is applicable to both tasks.  ... 
doi:10.1527/tjsai.23.505 fatcat:v4bph377erfexpyr46ubcws5ki

Statistical physics of hard optimization problems

Lenka Zdeborová
2009 Acta Physica Slovaca  
The principal question we address in this article is: How to recognize if an NP-complete constraint satisfaction problem is typically hard and what are the main reasons for this?  ...  We suggest a relation between the existence of the so-called frozen variables and the algorithmic hardness of a problem.  ...  Application to the exact cover (positive 1-in-3 SAT) The 1-in-3 SAT problem (with probability of negating a variable equal to one-half) is a rare example of an NP-complete problem which is on average algorithmically  ... 
doi:10.2478/v10155-010-0096-6 fatcat:7mc6yhbptnc65cf4sg6rzg4vi4

Statistical Physics of Hard Optimization Problems [article]

Lenka Zdeborová
2008 arXiv   pre-print
The principal question we address in this thesis is: How to recognize if an NP-complete constraint satisfaction problem is typically hard and what are the main reasons for this?  ...  We suggest a relation between the existence of the so-called frozen variables and the algorithmic hardness of a problem.  ...  To average over the ensemble of random graphs we adopt the same equations as we did for the belief propagation in sec. 1.5.3. 1.7.3 Application to the exact cover (positive 1-in-3 SAT) The 1-in-3 SAT problem  ... 
arXiv:0806.4112v1 fatcat:74fwqrf3vfg5vlvaggjve5sz4e

Ambulances Deployment Problems: Categorization, Evolution and Dynamic Problems Review

Dionicio Neira-Rodado, John Wilmer Escobar-Velasquez, Sally McClean
2022 ISPRS International Journal of Geo-Information  
Considering that state-of-the-art is moving to deal with more extensive and dynamic problems to address in a better way real-life instances, this research looks to identify the evolution and recent applications  ...  At the same time, a proposed notation tries to tackle the fact that the word problem in this kind of work refers to a model on many occasions.  ...  MILP is the preferred approach due to getting an exact solution. ISPRS Int. J. Geo-Inf. 2022, 10, x FOR PEER REVIEW 25 of 37 In a novel application, game theory was used by Abensur et al.  ... 
doi:10.3390/ijgi11020109 fatcat:eufgdz6orvacjgrs2bgllkwyze

On the Use of Biased-Randomized Algorithms for Solving Non-Smooth Optimization Problems

Angel Alejandro Juan, Canan Gunes Corlu, Rafael David Tordecilla, Rocio de la Torre, Albert Ferrer
2019 Algorithms  
Soft constraints are quite common in real-life applications.  ...  In this paper, we propose the use of biased-randomized algorithms as an effective methodology to cope with NP-hard and non-smooth optimization problems in many practical applications.  ...  Sona Taheri for inviting us to participate in this special issue in honor of Prof. Dr. Adil M. Bagirov. Conflicts of Interest: The authors declare no conflict of interest. Algorithms 2020, 13, 8  ... 
doi:10.3390/a13010008 fatcat:544u6u63lzeo7lh2dp7evfbwua

Simplified Modeling and Solving of Logistics Optimization Problems

Hanno Friedrich, Jonathan Gumpp
2014 International Journal of Transportation  
It presents a classification of general simplification principles that are useful for reducing the complexity of logistics problems, in order to facilitate understanding between academics and practice.  ...  Due to the variety of existing approaches and the specifics of each problem it is often difficult to find an appropriate method.  ...  lead to a globally optimal solution" ( [108] ).  ... 
doi:10.14257/ijt.2014.2.1.03 fatcat:bmhipzlngjernkere5kta3m3yq

Quiet Planting in the Locked Constraint Satisfaction Problems

Lenka Zdeborová, Florent Krzakala
2011 SIAM Journal on Discrete Mathematics  
We study the planted ensemble of locked constraint satisfaction problems. We describe the connection between the random and planted ensembles.  ...  Our main result is the location of the hard region in the planted ensemble. In a part of that hard region instances have with high probability a single satisfying assignment.  ...  We thank to Dimitris Achlioptas, Amin Coja-Oghlan, Matti Jarvisalo, Andrea Montanari, Cris Moore and Guilhem Semerjian for fruitful discussions and suggestions.  ... 
doi:10.1137/090750755 fatcat:3jsyuj2h2rerlhmtc3eqxlmboi

Facility Location Problems: Models, Techniques, and Applications in Waste Management

Olawale J. Adeleke, David O. Olukanni
2020 Recycling  
Some of the optimization techniques that have been applied to location problems are also presented along with an appropriate pseudocode algorithm for their implementation.  ...  Concerning the models and solution techniques, the survey concludes by summarizing some recent studies on the applications of FLPs to waste collection and disposal.  ...  Acknowledgments: The authors are grateful to the management of Covenant and Redeemer's Universities for providing an enabling environment in doing the report of this research work.  ... 
doi:10.3390/recycling5020010 fatcat:fqylm5cp7bce3j54p3ywbx2rtq

Algorithm Engineering for Cut Problems [article]

Alexander Noe
2021 arXiv   pre-print
This work develops highly-efficient algorithms for the (global) minimum cut problem, the balanced graph partitioning problem and the multiterminal cut problem.  ...  There is a multitude of cut or partitioning problems that have been the focus of research for multiple decades.  ...  A variant of the minimum cut problem is the problem of finding all global minimum cuts in a graph. The minimum cut problem has applications in many fields.  ... 
arXiv:2108.04566v1 fatcat:4tpyybkhsvg6toiuxkvdvychqu

Selective Routing Problem with Synchronization

Jorge Riera-Ledesma, Juan-José Salazar-González
2021 Computers & Operations Research  
The problem must also find a sequence of configurations for the bars in each band to maximize the total priority of the selection, subject to some synchronization issues and the time limitation.  ...  One of them is a set-partitioning model where a master problem manages the synchronization constraints and a subproblem generates columns satisfying the time limitation.  ...  Acknowledgements The authors thank Prof. Francisco Garzón López at the "Instituto de Astrofísica de Canarias" for posing and describing this optimization problem.  ... 
doi:10.1016/j.cor.2021.105465 fatcat:6sqdkwda4zdv5pn24z67ajixeu

Entropy-Based Framework for Dynamic Coverage and Clustering Problems

Puneet Sharma, Srinivasa M. Salapaka, Carolyn L. Beck
2012 IEEE Transactions on Automatic Control  
In particular, we define the problem of minimizing instantaneous coverage as a combinatorial optimization problem in a Maximum Entropy Principle (MEP) framework that we formulate specifically for the dynamic  ...  We propose a computationally efficient framework to solve a large class of dynamic coverage and clustering problems, ranging from those that arise from deployment of mobile sensor networks to classification  ...  that continuously cover a set of mobile sites in a region.  ... 
doi:10.1109/tac.2011.2166713 fatcat:465q3hzkczb3bpl6qouzaptkxa

Evolutionary-Based Hybrid Optimizer Applicable to Large-Scale Design Problems

Kazuhisa CHIBA
2013 Journal of Computational Science and Technology  
Third point is the application to practical problems.  ...  order to employ practical engineering applications.  ...  Acknowledgment The present study was supported in part by the Ministry of Education, Science, Sports and Culture of Japan through a Grants-in-Aid for Young Scientists (B) 22077155, 2010.  ... 
doi:10.1299/jcst.7.28 fatcat:5gqwlzksavdoxd34ae7264ivcm

Incremental Treatments of the Full Configuration Interaction Problem [article]

Janus J. Eriksen, Jürgen Gauss
2020 arXiv   pre-print
A selected few of the most recent applications of MBE-FCI are revisited, before we close by outlining its future research directions as well as its place among modern near-exact wave function-based methods  ...  Besides providing a succinct summary of the history of MBE-FCI to date within a generalized and unified theoretical setting, its finer algorithmic details are discussed alongside our optimized computational  ...  Applications Having covered its theoretical basis, we will now review a selected few of the molecular systems for which MBE-FCI has been applied to date.  ... 
arXiv:2012.07371v1 fatcat:yychhqdjmbht7fphqx5ieumwiy

Incremental treatments of the full configuration interaction problem

Janus J. Eriksen, Jürgen Gauss
2021 Wiley Interdisciplinary Reviews. Computational Molecular Science  
A selected few of the most recent applications of MBE-FCI are revisited, before we close by outlining its future research directions as well as its place among modern near-exact wave function-based methods  ...  Besides providing a succinct summary of the history of MBE-FCI to date within a generalized and unified theoretical setting, its finer algorithmic details are discussed alongside our optimized computational  ...  ACKNOWLEDGMENTS The authors wish to thank Cyrus Umrigar of Cornell University for fruitful discussions and for sharing part of the data behind Figure 5 . Janus J.  ... 
doi:10.1002/wcms.1525 fatcat:oegpeigwrzcnnescgmbrrhhr24
« Previous Showing results 1 — 15 out of 30,913 results