Filters








325,869 Hits in 6.2 sec

Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling

Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau
2013 INFORMS journal on computing  
We present a branch-and-price algorithm to solve personalized multi-activity shift scheduling problems.  ...  We present computational experiments on two types of multi-activity shift scheduling problems and compare our approach with existing methods in the literature.  ...  This section presents computational results on a personalized multi-activity shift scheduling problem introduced by Lequy et al. (2009) under the name multi-activity assignment problem.  ... 
doi:10.1287/ijoc.1120.0514 fatcat:5ldpzg4kqvf5pcay7hahkmbryq

Finding an optimal seating arrangement for employees traveling to an event

Ninoslav Čerkez, Rebeka Čorić, Mateja Đumić, Domagoj Matijević
2015 Croatian Operational Research Review  
Each employee is free to choose the time to travel to and from an event and it depends on personal reasons.  ...  The paper deals with modelling a specific problem called the Optimal Seating Arrangement (OSA) as an Integer Linear Program and demonstrated that the problem can be efficiently solved by combining branch-and-bound  ...  In the Set Cover problem, a person is given a set of elements called the universe, and a set of sets where the union is equivalent to the universe.  ... 
doi:10.17535/crorr.2015.0032 fatcat:dn33wcbpyjamram7skujp3kqhu

Optimized Pedestrian Detection for Multiple and Occluded People

Sitapa Rujikietgumjorn, Robert T. Collins
2013 2013 IEEE Conference on Computer Vision and Pattern Recognition  
The framework is flexible enough to handle the problem of detecting objects as a shape covering of a foreground mask, and to handle the problem of filtering confidence weighted detections produced by a  ...  We present a quadratic unconstrained binary optimization (QUBO) framework for reasoning about multiple object detections with spatial overlaps.  ...  The first is a shape covering approach, based on finding size and placement of a set of pedestrian shapes in order to cover the pixels of a foreground mask computed by, e.g., background subtraction.  ... 
doi:10.1109/cvpr.2013.473 dblp:conf/cvpr/RujikietgumjornC13 fatcat:rlzoqjivlnhchnkx7x56mwhdwm

Solving covering problems using LPR-based lower bounds

Stan Liao, Srinivas Devadas
1997 Proceedings of the 34th annual conference on Design automation conference - DAC '97  
Previous branch-and-bound methods for exactly solving these problems use lower-bounding techniques based on finding maximal independent sets.  ...  We show that a combination of traditional reductions (essentiality and dominance) and incremental computation of LPR-based lower bounds can exactly solve difficult covering problems orders of magnitude  ...  Although LPR has been extensively used in solving integer linear programming problems, its power has been largely overlooked in solving covering problems.  ... 
doi:10.1145/266021.266046 dblp:conf/dac/LiaoD97 fatcat:u5qbq66safe5llgd2726bcnw7a

Power in unity

Aris Anagnostopoulos, Luca Becchetti, Carlos Castillo, Aristides Gionis, Stefano Leonardi
2010 Proceedings of the 19th ACM international conference on Information and knowledge management - CIKM '10  
The internet has enabled the collaboration of groups at a scale that was unseen before. A key problem for large collaboration groups is to be able to allocate tasks effectively.  ...  In this paper we present a general framework for taskassignment problems. We provide a formal treatment on how to represent teams and tasks.  ...  Sum-Load and ExpLoad require to solve a weighted set cover problem rather than an unweighted set cover problem as in Size and MaxLoad.  ... 
doi:10.1145/1871437.1871515 dblp:conf/cikm/AnagnostopoulosBCGL10 fatcat:nwptigi565cc7cwlegmhgdos34

Solving Covering Problems Using LPR-based Lower Bounds

S. Liao, S. Devadas
1997 Proceedings of the 34th Design Automation Conference  
Previous branch-and-bound methods for exactly solving these problems use lower-bounding techniques based on finding maximal independent sets.  ...  We show that a combination of traditional reductions (essentiality and dominance) and incremental computation of LPR-based lower bounds can exactly solve difficult covering problems orders of magnitude  ...  Although LPR has been extensively used in solving integer linear programming problems, its power has been largely overlooked in solving covering problems.  ... 
doi:10.1109/dac.1997.597128 fatcat:qkht3b6ninhbhgxtcz2vh2rchy

Schlumberger Optimizes Receiver Location for Automated Meter Reading

Srinagesh Gavirneni, Lloyd Clark, Gábor Pataki
2004 Interfaces  
Schlumberger first encountered this large-scale problem in a project it ran for Illinois Power.  ...  In a geographic region, the problem is to install the minimum number of receivers on existing utility poles so that all wireless meters in that region can transmit their readings to at least one.  ...  The first solution approach that comes to mind is one that selects the poles in a greedy manner. To use the greedy procedure to solve this problem, we compute the number of meters each pole covers.  ... 
doi:10.1287/inte.1030.0069 fatcat:qqytbmknjrctriz2vr26ofuvvi

A column generation approach to the airline crew pairing problem to minimize the total person-days

Wei WU, Yannan HU, Hideki HASHIMOTO, Tomohito ANDO, Takashi SHIRAKI, Mutsunori YAGIURA
2016 Journal of Advanced Mechanical Design, Systems, and Manufacturing  
We formulate the problem as a set covering problem and apply an LP-based column generation approach to generate a candidate set of schedules.  ...  Computational results are given for a number of large-scale instances with up to 10,000 flights.  ...  In this paper, we model the problem as a set covering problem with costs of columns defined by the number of person-days, and then we present an efficient method to find promising columns through a graph  ... 
doi:10.1299/jamdsm.2016jamdsm0040 fatcat:pnhaeg54lrbidihg7pqj5lc2ru

An Effective Deflected Subgradient Optimization Scheme for Implementing Column Generation for Large-Scale Airline Crew Scheduling Problems

Shivaram Subramanian, Hanif D. Sherali
2008 INFORMS journal on computing  
W e present a new deflected subgradient scheme for generating good quality dual solutions for linear programming (LP) problems and utilize this within the context of large-scale airline crew planning problems  ...  The motivation for the development of this method came from the failure of a black-boxtype approach implemented at United Airlines for solving such problems using column generation in concert with a commercial  ...  solve the multiobjective crew scheduling problem in its entirety within a reasonable amount of computational time.  ... 
doi:10.1287/ijoc.1080.0267 fatcat:dkqnserqarf7fbtfxhdiduc77q

Overlapping clusters for distributed computation

Reid Andersen, David F. Gleich, Vahab Mirrokni
2012 Proceedings of the fifth ACM international conference on Web search and data mining - WSDM '12  
This algorithm covers the vertex set with a collection of overlapping clusters. Each vertex in the graph is well-contained within some cluster in the collection.  ...  We then describe a framework for distributed computation across a collection of overlapping clusters and describe how this framework can be used in various algorithms based on the graph diffusion process  ...  To find a minimum-cost overlapping cover, we need to find a set of clusters that cover all the nodes of the network. This can be formalized as a set cover problem.  ... 
doi:10.1145/2124295.2124330 dblp:conf/wsdm/AndersenGM12 fatcat:dzkgf2tblngyrfhj5aptslkncy

Approximating the minimum hub cover problem on planar graphs

Belma Yelbay, Ş. İlker Birbil, Kerem Bülbül, Hasan Jamil
2015 Optimization Letters  
We study an approximation algorithm with a performance guarantee to solve a new NP-hard optimization problem on planar graphs.  ...  The problem, which is referred to as the minimum hub cover problem, has recently been introduced to the literature to improve query processing over large graph databases.  ...  ., 2013 ) discusses the connection between the MHC concept and query processing and analyzes the computational cost of solving the MHC problem on a diverse set of graph databases.  ... 
doi:10.1007/s11590-015-0876-5 fatcat:xzmopsaflrgjtdsl7nnridg2my

The complexity of the Quantum Adiabatic Algorithm

A.P. Young, S. Knysh, V.N. Smelyanskiy
2011 Computer Physics Communications  
SECURITY CLASSIFICATION OF: The Quantum Adiabatic Algorithm has been proposed as a general purpose algorithm for solving hard optimization problems on a quantum computer.  ...  Early work on very small sizes indicated that the running time (complexity) only increased as a (quite small) power of the problem size N.  ...  Integer factoring is in a set BQP, which contains those problems which can be solved in polynomial time on a quantum computer. On account of Shor's algorithm, it appears that BQP is larger than P.  ... 
doi:10.1016/j.cpc.2010.06.001 fatcat:3tcqvaqqi5g57eq7t4nzoqubk4

On Evaluating Human Problem Solving of Computationally Hard Problems

Sarah Carruthers, Ulrike Stege
2013 Journal of Problem Solving  
Examples of hard puzzles include Sudoku, Minesweeper, and the 15-Puzzle. (3) A number of research articles in the area of human problem solving suggest that humans are capable of solving hard computational  ...  This article gives a brief introduction to some theories and foundations of complexity theory and motivates the use of computationally hard problems in human problem solving with a short survey of known  ...  However, the following definition of a computational problem equally applies if the problem solver is a person, a group, an algorithm, a combination of person and computational device, or a cognitive function  ... 
doi:10.7771/1932-6246.1152 fatcat:igkjpgzuj5aotdaltqizybaq2i

Computation of Minimum-Volume Covering Ellipsoids

Peng Sun, Robert M. Freund
2004 Operations Research  
Our computational results demonstrate that our method solves very large problem instances (m = 30 000 and n = 30) to a high degree of accuracy in under 30 seconds on a personal computer.  ...  Here we focus on computation. We present a combined interior-point and active-set method for solving this problem.  ...  Acknowledgments The authors thank Kim Chuan Toh for his assistance with the software SDPT3 and for his guidance on computational matters.  ... 
doi:10.1287/opre.1040.0115 fatcat:yeysbhovyra2ncezuuhepsy6ny

Computation of Minimum Volume Covering Ellipsoids

Peng Sun, Robert M. Freund
2002 Social Science Research Network  
Our computational results demonstrate that our method solves very large problem instances (m = 30 000 and n = 30) to a high degree of accuracy in under 30 seconds on a personal computer.  ...  Here we focus on computation. We present a combined interior-point and active-set method for solving this problem.  ...  Acknowledgments The authors thank Kim Chuan Toh for his assistance with the software SDPT3 and for his guidance on computational matters.  ... 
doi:10.2139/ssrn.321262 fatcat:gevi5hwrozfh5oik73c3runwii
« Previous Showing results 1 — 15 out of 325,869 results