Filters








80 Hits in 4.0 sec

New Constraint Programming Approaches for the Computation of Leximin-Optimal Solutions in Constraint Networks

Sylvain Bouveret, Michel Lemaître
2007 International Joint Conference on Artificial Intelligence  
We study the problem of computing a leximinoptimal solution of a constraint network.  ...  We compare several generic algorithms which solve this problem in a constraint programming framework.  ...  Our first approach for computing a leximin-optimal solution is presented in algorithm 1.  ... 
dblp:conf/ijcai/BouveretL07 fatcat:friezska6fgwhelz3xqp7lwus4

Computing leximin-optimal solutions in constraint networks

Sylvain Bouveret, Michel Lemaître
2009 Artificial Intelligence  
In this article, we describe five algorithms for finding leximin-optimal solutions using constraint programming. Three of these algorithms are original.  ...  A way to characterize good solutions in such problems is to use the leximin preorder to compare the vectors of objective values, and to select the solutions which maximize this preorder.  ...  Acknowledgements Authors would like to thank the anonymous reviewers for their comments and suggestions.  ... 
doi:10.1016/j.artint.2008.10.010 fatcat:mmvfjqw6mzcldc2hhjxlpaf74i

An algorithm to calculates an allocation maximizing the leximin order on the utility profiles of the agents

Sylvain Bouveret, Michel Lemaître
2020 International Journal of Information Technology and Applied Sciences (IJITAS)  
Two implementations of the algorithm are compared, one in "pure" constraint programming, with Choco, the other in mixed linear programming with Cplex.  ...  In the context of constraint programming, we propose an algorithm solving the following problem: allocate in an equitable and efficient way a finite set of objects to agents each having their own utilities  ...  OR and AI provide us with the framework for constraint programming, in which we provide a simple, centralized algorithm for finding leximin-optimal allocations.  ... 
doi:10.52502/ijitas.v2i4.13 fatcat:pd7rv2rpdjhuhbwdpicinyjbdi

The Package Server Location Problem
english

Arnaud Malapert, Jean-Charles Régin, Jean Parpaillon
2013 Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems  
Results for exact multi-objective solution approaches based on mixed integer linear programming are reported.  ...  In this paper, we introduce a new multi-objective optimization problem derived from a real-world application: the package server location problem.  ...  This work was supported by the Agence Nationale de la Recherche (Aeolus project -ANR-2010-SEGI-013-01). To end, we would like to thank the anonymous referees for their remarks.  ... 
doi:10.5220/0004282501930204 dblp:conf/icores/MalapertRP13 fatcat:37nwyjqy3zav3ncnxpbbiux7u4

A Bi-Objective Field-Visit Planning Problem for Rapid Needs Assessment under Travel-Time Uncertainty

Mohammadmehdi Hakimifar, Vera C. Hemmelmayr, Fabien Tricoire
2022 Sustainability  
We apply the robust optimization approach to tackle travel-time uncertainty due to its advantages in requiring fewer data for uncertain parameters and immunizing a feasible solution under all possible  ...  In particular, within our bi-objective solution approach, we provide the set of non-dominated solutions that differ in terms of total route duration and the vector of community coverage ratio at different  ...  Acknowledgments: The authors would like to thank Burcu Balcik for providing the data. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/su14053024 fatcat:6hwp5o6dqjelfastexecjucjha

Strategies for Global Optimization of Temporal Preferences [chapter]

Paul Morris, Robert Morris, Lina Khatib, Sailesh Ramakrishnan, Andrew Bachmann
2004 Lecture Notes in Computer Science  
A technique is described for identifying and representing the entire set of utilitarian-optimal solutions to a temporal problem with preferences.  ...  A temporal reasoning problem can often be naturally characterized as a collection of constraints with associated local preferences for times that make up the admissible values for those constraints.  ...  Thus, the extended solution is in the optimal face of the LPP, and hence S is optimal for the STPP.  ... 
doi:10.1007/978-3-540-30201-8_31 fatcat:3z4vdfrjizegndt23selmto6u4

Assigning Papers to Referees [chapter]

Kurt Mehlhorn
2009 Lecture Notes in Computer Science  
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program.  ...  Some of these variants can be solved optimally in polynomial time, while others are NP-hard, in which case we design approximation algorithms.  ...  Concluding remarks In this paper we have studied the problem of assigning papers to referees.  ... 
doi:10.1007/978-3-642-02927-1_1 fatcat:xrkl2m6v3vbtpmjoswzdbh2yum

Assigning Papers to Referees

Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre
2010 Algorithmica  
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program.  ...  Some of these variants can be solved optimally in polynomial time, while others are NP-hard, in which case we design approximation algorithms.  ...  Concluding remarks In this paper we have studied the problem of assigning papers to referees.  ... 
doi:10.1007/s00453-009-9386-0 fatcat:dkzjpzjebrb3vfhplanibd4jcq

A fuzzy constraint-based approach to data reconciliation in material flow analysis

Didier Dubois, Hélène Fargier, Meïssa Ababou, Dominique Guyonnet
2014 International Journal of General Systems  
The conventional approach relies on least squares minimization. Here, we use a fuzzy-set-based approach, replacing Gaussian likelihood functions by fuzzy intervals, and a leximin criterion.  ...  We show that the setting of fuzzy sets provides a generalized approach to the choice of estimated values, that is more flexible and less dependent on oftentimes debatable probabilistic justifications.  ...  Thanks to Romain Leroux for his help on the copper example.  ... 
doi:10.1080/03081079.2014.920840 fatcat:pdtt6fxxezbx5afmlbusdneieq

A Unified Framework for Max-Min and Min-Max Fairness With Applications

Bozidar Radunovic, Jean-Yves Le Boudec
2007 IEEE/ACM Transactions on Networking  
Its complexity is of the order of N linear programming steps in R N , in the case where the feasible set is defined by linear constraints.  ...  Second, we give a general purpose, centralized algorithm, called Max-min Programming, for computing the max-min fair allocation in all cases where it exists (whether the set of feasible allocations is  ...  Its complexity is of the order of N linear programming steps in R N , in the case where the feasible set is defined by linear constraints.  ... 
doi:10.1109/tnet.2007.896231 fatcat:sd5lkzcsj5f7xn7j2ge5vtpp3a

A lexicographic maximin approach to the selective assessment routing problem [article]

Mohammadmehdi Hakimifar, Vera Hemmelmayr, Fabien Tricoire
2022 arXiv   pre-print
We define the leximin selective assessment problem, which considers the bi-objective optimization of total assessment time and coverage ratio vector maximization.  ...  These approaches, however, have a significant drawback of being neutral when it comes to solutions with the same minimum values.  ...  Acknowledgments The authors want to thank Balcik (2017) for providing us with the data set used in her study. Appendix A Boxplots  ... 
arXiv:2201.09599v1 fatcat:f2ogirvrjjhp5omvqlvhfy23ie

Constrained global optimization for wine blending

Philippe Vismara, Remi Coletta, Gilles Trombettoni
2015 Constraints  
We also study the performance of other optimization goals that could be embedded in a configuration tool, where the different possible interactions amount to solving the same constraints with different  ...  This paper describes the modeling of wine assemblage as a mixed constrained optimization problem, where the main goal is to minimize the gap to the desired concentrations for every aromatic criterion.  ...  The neural network performed multicriteria optimization for adjusting each aroma. The comparison with our approach is difficult in terms of quality since we resort to monocriterion optimization.  ... 
doi:10.1007/s10601-015-9235-5 fatcat:j6v25bcagzeq7jjakpjilifdim

A constraint programming algorithm for finding leximin-optimal allocations

Rahmatullah Muin
2020 International Journal of Information Technology and Applied Sciences (IJITAS)  
Two implementations of the algorithm are compared, one in "pure" constraint programming, with Choco, the other in mixed linear programming with Cplex.  ...  In the context of constraint programming, we propose an algorithm solving the following problem: allocate in an equitable and efficient way a finite set of objects to agents each having their own utilities  ...  .: A constraint programming algorithm for finding leximin-optimal allocations http://woasjournals.com/index.php/ijitas  ... 
doi:10.52502/ijitas.v2i2.11 fatcat:umjrz247yrgxxfpuatyjxhifty

Repairing inconsistent answer set programs using rules of thumb: A gene regulatory networks case study

Elie Merhej, Steven Schockaert, Martine De Cock
2017 International Journal of Approximate Reasoning  
We analyze the potential of using expert knowledge in this way, by focusing on a specific case study: Gene Regulatory Networks.  ...  In such cases, it is of interest to find plausible repairs, i.e. plausible modifications to the original program that ensure the existence of at least one answer set.  ...  In Section 5, we present different approaches for aggregating rules of thumb to identify optimal repairs for an inconsistent ASP program. In Section 6, we introduce the considered application domain.  ... 
doi:10.1016/j.ijar.2017.01.012 fatcat:qu2mxo4ohfdhxczzjcl6oo3yoq

The ethical shortlisting problem

Güneş Erdoğan
2021 Computers & Operations Research  
This paper attempts to apply Computational Ethics to the shortlisting process in hiring through the use of Linear Programming.  ...  Given a set of applicants for a job with numerical qualification values, the author aims to determine weights for each qualification type to compute scores and resulting rankings for each applicant.  ...  Acknowledgments Thanks are due to Danish Mishra and Ralph Behnke for a fruitful discussion on the recruitment process as part of the groundwork for the paper.  ... 
doi:10.1016/j.cor.2021.105593 fatcat:avufnoq4e5fqhprdktogjjug2m
« Previous Showing results 1 — 15 out of 80 results