Search results for "combinatorial optimization problems"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Petrica C. Pop, Corina Pop Sitar, Ioana Zelina, Ioana Tascu	Exact Algorithms for Generalized Combinatorial Optimization Problems.	COCOA	2007	DBLP DOI BibTeX RDF	generalized combinatorial optimization problems, dynamic programming, exact algorithms
3	Reinhard Lüling, Burkhard Monien, Alexander Reinefeld, Stefan Tschöke	Mapping tree-structured combinatorial optimization problems onto parallel computers.	Solving Combinatorial Optimization Problems in Parallel	1996	DBLP DOI BibTeX RDF
3	Afonso Ferreira, Panos M. Pardalos	SCOOP: Solving Combinatorial Optimization Problems in Parallel.	Solving Combinatorial Optimization Problems in Parallel	1996	DBLP DOI BibTeX RDF
2	Serban Iordache	Consultant-guided search: a new metaheuristic for combinatorial optimization problems.	GECCO	2010	DBLP DOI BibTeX RDF	combinatorial optimization, swarm intelligence, traveling salesman problem, metaheuristics
2	Raj Gaurang Tiwari, Mohd. Husain, Sandeep Gupta, Arun Pratap Srivastava	A new ant colony optimization meta-heuristic algorithm to tackle large optimization problem.	Bangalore Compute Conf.	2010	DBLP DOI BibTeX RDF	artificial and swarm intelligence, meta-heuristic algorithms, ant colony optimization, combinatorial optimization problems
2	Parvaz Mahdabi, Mahdi Abadi, Saeed Jalili	A novel quantum-inspired evolutionary algorithm for solving combinatorial optimization problems.	GECCO	2009	DBLP DOI BibTeX RDF	NK-landscapes problem, evolutionary algorithms, combinatorial optimization, quantum computing, knapsack problem
2	Jean Cardinal, Samuel Fiorini, Gwenaël Joret	Minimum Entropy Combinatorial Optimization Problems.	CiE	2009	DBLP DOI BibTeX RDF
2	Yujun Zheng, Jinyun Xue, Zhengkang Zuo	Toward an Automatic Approach to Greedy Algorithms.	FAW	2009	DBLP DOI BibTeX RDF	PAR method, problem singleton, greedy algorithm, Combinatorial optimization problems
2	Federico Della Croce, Vangelis Th. Paschos	Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems.	Operational Research	2008	DBLP DOI BibTeX RDF	Dominance conditions, Set covering, Max cut, Worst-case complexity
2	Shashi Mittal, Andreas S. Schulz	A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
2	Madjid Khichane, Patrick Albert, Christine Solnon	CP with ACO.	CPAIOR	2008	DBLP DOI BibTeX RDF
2	Birgit Grohe, Dag Wedelin	Cost Propagation - Numerical Propagation for Optimization Problems.	CPAIOR	2008	DBLP DOI BibTeX RDF
2	Jing Tang, Meng-Hiot Lim, Yew-Soon Ong	Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems.	Soft Comput.	2007	DBLP DOI BibTeX RDF	Island model parallel memetic algorithm, Adaptive local search frequency, Quadratic assignment problem
2	Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Talbi	A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems.	IPDPS	2007	DBLP DOI BibTeX RDF
2	Brett Bojduj, Dennis Taylor, Franz J. Kurfess	Optimization of Dynamic Combinatorial Optimization Problems Through Truth Maintenance.	IEA/AIE	2007	DBLP DOI BibTeX RDF
2	Emilio G. Ortíz-García, Ángel M. Pérez-Bellido	Hybrid Cross-Entropy Method/Hopfield Neural Network for Combinatorial Optimization Problems.	IDEAL	2007	DBLP DOI BibTeX RDF
2	Gaurav Trivedi, Sumit Punglia, H. Narayanan	Application of DC Analyzer to Combinatorial Optimization Problems.	VLSI Design	2007	DBLP DOI BibTeX RDF
2	Adam Kasperski, Pawel Zielinski	Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems.	IFSA	2007	DBLP DOI BibTeX RDF
2	Hassene Aissi	Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems.	4OR	2006	DBLP DOI BibTeX RDF	Min-max regret, Complexity, Combinatorial optimization, Approximation, Data association, Robustness analysis, Min-max
2	Gaurav Trivedi, Madhav P. Desai, H. Narayanan	Fast DC Analysis and Its Application to Combinatorial Optimization Problems.	VLSI Design	2006	DBLP DOI BibTeX RDF
2	Claire Kenyon, Meinolf Sellmann	Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming.	CPAIOR	2006	DBLP DOI BibTeX RDF
2	Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye	Stochastic Combinatorial Optimization with Controllable Risk Aversion Level.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
2	Manuel Iori	Metaheuristic algorithms for combinatorial optimization problems.	4OR	2005	DBLP DOI BibTeX RDF	Scheduling, Metaheuristics, Transportation, Packing
2	John W. Fowler, Bosun Kim, W. Matthew Carlyle, Esma Senturk Gel, Shwu-Min Horng	Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems.	J. Scheduling	2005	DBLP DOI BibTeX RDF	multiple criteria combinatorial optimization, comparison measures, parallel machine scheduling
2	José E. Gallardo, Carlos Cotta, Antonio J. Fernández	A hybrid model of evolutionary algorithms and branch-and-bound for combinatorial optimization problems.	Congress on Evolutionary Computation	2005	DBLP DOI BibTeX RDF
2	Adam Kasperski, Pawel Zielinski	A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids.	WILF	2005	DBLP DOI BibTeX RDF
2	Aletia Patrícia Favacho de Araujo, Sebastián Urrutia	Towards Grid Implementations of Metaheuristics for Hard Combinatorial Optimization Problems.	SBAC-PAD	2005	DBLP DOI BibTeX RDF
2	Fabián A. Chudak, Vânia Eleutério	Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems.	IPCO	2005	DBLP DOI BibTeX RDF
2	SeungGwan Lee	Multiagent Elite Search Strategy for Combinatorial Optimization Problems.	ISCIS	2005	DBLP DOI BibTeX RDF
2	Moses Charikar, Chandra Chekuri, Martin Pál	Sampling Bounds for Stochastic Optimization.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
2	Federico Della Croce, Marco Ghirardi, Roberto Tadei	Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems.	J. Heuristics	2004	DBLP DOI BibTeX RDF	recovering beam search, scheduling, heuristics, location
2	Lipo Wang, Sa Li, F. Tian, Xiuju Fu	A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing.	IEEE Transactions on Systems, Man, and Cybernetics, Part B	2004	DBLP DOI BibTeX RDF
2	Nicole Immorlica, David R. Karger, Maria Minkoff, Vahab S. Mirrokni	On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems.	SODA	2004	DBLP DOI BibTeX RDF
2	Stefka Fidanova	Convergence Proof for a Monte Carlo Method for Combinatorial Optimization Problems.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
2	Ionut D. Aron, John N. Hooker, Tallys H. Yunes	SIMPL: A System for Integrating Optimization Techniques.	CPAIOR	2004	DBLP DOI BibTeX RDF
2	Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro	Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems.	IPDPS	2003	DBLP DOI BibTeX RDF
2	Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espanés, Paul W. K. Rothemund	Combinatorial optimization problems in self-assembly.	STOC	2002	DBLP DOI BibTeX RDF
2	Enrique Alba Torres, Sami Khuri	Applying Evolutionary Algorithms to Combinatorial Optimization Problems.	International Conference on Computational Science	2001	DBLP DOI BibTeX RDF
2	Gerald Gruber, Franz Rendl	The Bundle Method for Hard Combinatorial Optimization Problems.	Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
2	T. Nakaguchi, K. Jin'no, M. Tanaka	Hardware combinatorial optimization problems solver by hysteresis neural networks.	ISCAS	2001	DBLP DOI BibTeX RDF
2	Fuyu Tian, Lipo Wang	Augmented Lagrange Chaotic Simulated Annealing for Combinatorial Optimization Problems.	IJCNN	2000	DBLP DOI BibTeX RDF
2	Lipo Wang, Fuyu Tian	Noisy Chaotic Neural Networks for Solving Combinatorial Optimization Problems.	IJCNN	2000	DBLP DOI BibTeX RDF
2	Afonso Ferreira, Panos M. Pardalos (eds.)	Solving Combinatorial Optimization Problems in Parallel - Methods and Techniques	Solving Combinatorial Optimization Problems in Parallel	1996	DBLP BibTeX RDF
2	Daniel P. Bovet, Andrea E. F. Clementi, Pierluigi Crescenzi, Riccardo Silvestri	Parallel approximation of optimization problems.	Solving Combinatorial Optimization Problems in Parallel	1996	DBLP DOI BibTeX RDF
2	Arie de Bruin, Gerard A. P. Kindervater, Harry W. J. M. Trienekens	Towards an abstract parallel branch and bound machine.	Solving Combinatorial Optimization Problems in Parallel	1996	DBLP DOI BibTeX RDF
2	Panos M. Pardalos, Guoliang Xue, P. D. Panagiotopoulos	Parallel algorithms for global optimization problems.	Solving Combinatorial Optimization Problems in Parallel	1996	DBLP DOI BibTeX RDF
2	Mohamed Benaïchouche, Van-Dat Cung, Salah Dowaji, Bertrand Le Cun, Thierry Mautor, Catherine Roucairol	Building a parallel branch and bound library.	Solving Combinatorial Optimization Problems in Parallel	1996	DBLP DOI BibTeX RDF
2	Graham M. Megson, L. Rapanotti, Xian Chen	Automatic synthesis of parallel algorithms.	Solving Combinatorial Optimization Problems in Parallel	1996	DBLP DOI BibTeX RDF
2	Marc Gengler	An introduction to parallel dynamic programming.	Solving Combinatorial Optimization Problems in Parallel	1996	DBLP DOI BibTeX RDF
2	Ricardo C. Corrêa, Afonso Ferreira	Parallel best-first branch-and-bound in discrete optimization: a framework.	Solving Combinatorial Optimization Problems in Parallel	1996	DBLP DOI BibTeX RDF
2	Andrea E. F. Clementi, José D. P. Rolim, Erik Urland	Randomized parallel algorithms.	Solving Combinatorial Optimization Problems in Parallel	1996	DBLP DOI BibTeX RDF
2	Per S. Laursen	Parallel heuristic search - Introductions and a new approach.	Solving Combinatorial Optimization Problems in Parallel	1996	DBLP DOI BibTeX RDF
1	Marie-José Huguet, Pierre Lopez, Wafa Karoui	Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems.	J. Math. Model. Algorithms	2012	DBLP DOI BibTeX RDF
1	Agustín Bompadre	Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems.	Algorithmica	2012	DBLP DOI BibTeX RDF
1	C. W. Duin, A. Volgenant	On weighting two criteria with a parameter in combinatorial optimization problems.	European Journal of Operational Research	2012	DBLP DOI BibTeX RDF
1	Sudipto Guha, Kamesh Munagala	Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems.	ACM Transactions on Algorithms	2012	DBLP DOI BibTeX RDF
1	Claudio T. Bornstein, Nelson Maculan, Marta Pascoal, Leizer L. Pinto	Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization.	Computers & OR	2012	DBLP DOI BibTeX RDF
1	Kate Smith-Miles, Leo Lopes	Measuring instance difficulty for combinatorial optimization problems.	Computers & OR	2012	DBLP DOI BibTeX RDF
1	Troy Lee, Dirk Oliver Theis	Lower bounds for sizes of semidefinite formulations for some combinatorial optimization problems	CoRR	2012	DBLP BibTeX RDF
1	Jean Cardinal, Samuel Fiorini, Gwenaël Joret	Minimum Entropy Combinatorial Optimization Problems.	Theory Comput. Syst.	2012	DBLP DOI BibTeX RDF
1	Lei Duan, Mustafa K. Dogru, Ulas Özen, J. Christopher Beck	A negotiation framework for linked combinatorial optimization problems.	Autonomous Agents and Multi-Agent Systems	2012	DBLP DOI BibTeX RDF
1	Aníbal Ponte, Luís Paquete, José Rui Figueira	On Beam Search for Multicriteria Combinatorial Optimization Problems.	CPAIOR	2012	DBLP DOI BibTeX RDF
1	Antoine Jouglet, Jacques Carlier	Dominance rules in combinatorial optimization problems.	European Journal of Operational Research	2011	DBLP DOI BibTeX RDF
1	Mark Sh. Levin	Four-layer framework for combinatorial optimization problems domain.	Advances in Engineering Software	2011	DBLP DOI BibTeX RDF
1	Alfredo Candia-Véjar, Eduardo Álvarez-Miranda, Nelson Maculan	Minmax regret combinatorial optimization problems: an Algorithmic Perspective.	RAIRO - Operations Research	2011	DBLP DOI BibTeX RDF
1	J. Francisco Chicano, L. Darrell Whitley, Enrique Alba	A Methodology to Find the Elementary Landscape Decomposition of Combinatorial Optimization Problems.	Evolutionary Computation	2011	DBLP DOI BibTeX RDF
1	Adam Kasperski, Pawel Zielinski	Possibilistic bottleneck combinatorial optimization problems with ill-known weights.	Int. J. Approx. Reasoning	2011	DBLP DOI BibTeX RDF
1	Nan Li, Yi Luo	An Improved Co-Evolution Genetic Algorithm for Combinatorial Optimization Problems.	ICSI	2011	DBLP DOI BibTeX RDF
1	Eddy Parkinson, Adam Ghandar, Zbigniew Michalewicz, Andrew Tuson	Estimating the reproductive potential of offspring in evolutionary heuristics for combinatorial optimization problems.	IEEE Congress on Evolutionary Computation	2011	DBLP DOI BibTeX RDF
1	Takahiro Sota, Yoshihiro Hayakawa, Shigeo Sato, Koji Nakajima	Method of Solving Combinatorial Optimization Problems with Stochastic Effects.	ICONIP	2011	DBLP DOI BibTeX RDF
1	Thibaut Lust, Jacques Teghem, Daniel Tuyttens	Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems.	EMO	2011	DBLP DOI BibTeX RDF
1	Adam Kasperski, Pawel Zielinski	Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios.	NL-MUA	2011	DBLP DOI BibTeX RDF
1	Tobias Achterberg, J. Christopher Beck (eds.)	Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 8th International Conference, CPAIOR 2011, Berlin, Germany, May 23-27, 2011. Proceedings	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Adam Kasperski, Pawel Zielinski	Min-max and two-stage possibilistic combinatorial optimization problems.	FUZZ-IEEE	2011	DBLP DOI BibTeX RDF
1	Jian Li, Amol Deshpande	Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems.	FOCS	2011	DBLP DOI BibTeX RDF
1	Ronnachai Sirovetnukul, Parames Chutima, Warin Wattanapornprom, Prabhas Chongstitvatana	The effectiveness of hybrid negative correlation learning in evolutionary algorithm for combinatorial optimization problems.	IEEM	2011	DBLP DOI BibTeX RDF
1	Christian Bessiere, Nina Narodytska, Claude-Guy Quimper, Toby Walsh	The AllDifferent Constraint with Precedences.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Helmut Simonis, Barry O'Sullivan	Almost Square Packing.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Craig Boutilier	Preference Elicitation and Preference Learning in Social Choice.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Nicolas Chapados, Marc Joliveau, Louis-Martin Rousseau	Retail Store Workforce Scheduling by Expected Operating Income Maximization.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	David Bergman, Willem Jan van Hoeve, John N. Hooker	Manipulating MDD Relaxations for Combinatorial Optimization.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	K. Subramani, James Worthington	A New Algorithm for Linear and Integer Feasibility in Horn Constraints.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Emrah B. Edis, Ceyda Oguz	Parallel Machine Scheduling with Additional Resources: A Lagrangian-Based Constraint Programming Approach.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Jean-Charles Régin, Thierry Petit	The Objective Sum Constraint.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Thanikesavan Sivanthi, Jan Poland	Efficient Planning of Substation Automation System Cables.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Gilles Pesant, Alessandro Zanarini	Recovering Indirect Solution Densities for Counting-Based Branching Heuristics.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Andrea Lodi, Gilles Pesant, Louis-Martin Rousseau	On Counting Lattice Points and Chvátal-Gomory Cutting Planes.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Asma Lahimer, Pierre Lopez, Mohamed Haouari	Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Ian P. Gent	Propagation in Constraints: How One Thing Leads to Another.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Michele Lombardi, Alessio Bonfietti, Michela Milano, Luca Benini	Precedence Constraint Posting for Cyclic Scheduling Problems.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Carleton Coffrin, Pascal Van Hentenryck, Russell Bent	Spatial and Objective Decompositions for Very Large SCAPs.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Andrea Lodi	On Bilevel Programming and Its Impact in Branching, Cutting and Complexity.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, François Margot, Andreas Wächter	A Probing Algorithm for MINLP with Failure Prediction by SVM.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Petr Vilím	Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Bistra N. Dilkina, Katherine J. Lai, Carla P. Gomes	Upgrading Shortest Paths in Networks.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Alessandro Zanarini, Pascal Van Hentenryck	Identifying Patterns in Sequences of Variables.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Jean-Charles Régin	Using Hard Constraints for Representing Soft Constraints.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Markus Aschinger, Conrad Drescher, Gerhard Friedrich, Georg Gottlob, Peter Jeavons, Anna Ryabokon, Evgenij Thorstensen	Optimization Methods for the Partner Units Problem.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Tim Januschowski, Marc E. Pfetsch	Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	Bernard Fortz, Michael Poss	Easy distributions for combinatorial optimization problems with probabilistic constraints.	Oper. Res. Lett.	2010	DBLP DOI BibTeX RDF