Search results for "problems"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
5	Adi Ditkowski	Numerical Method for Solving Discontinuous Initial/Final-Value Problems.	J. Sci. Comput.	2008	DBLP DOI BibTeX RDF	Initial/final-value problems, Hyperbolic embedding, Two point boundary value problems, Embedding, Optimal control, Boundary-value problems, ODE
5	Vincent Tam, Keng Teck Ma	Using heuristic-based optimizers to handle the personal computer configuration problems.	ICTAI	2000	DBLP DOI BibTeX RDF	heuristic-based optimizers, personal computer configuration problems, PC hardware components, discrete optimization problems, intelligent optimizers, beam search method, heuristic-based micro-genetic algorithm, Web-based personal computer configuration advisor, genetic algorithms, Internet, optimisation, configuration management, search problems, heuristic programming, information resources, budget, microcomputers
5	Thierry Petit, Jean-Charles Régin, Christian Bessière	Meta-constraints on violations for over constrained problems.	ICTAI	2000	DBLP DOI BibTeX RDF	meta constraints, over constrained problems, Max-CSP, real-life problems, constraint programming, constraint handling, communicating sequential processes, real-world problems
5	Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay	DNA Models and Algorithms for NP-complete Problems. (PDF / PS)	IEEE Conference on Computational Complexity	1996	DBLP DOI BibTeX RDF	3Sat, 3-Coloring, Independent Set problem, DNA algorithms, genetic algorithms, computational complexity, search problems, DNA computing, DNA computation, NP-complete problems, search algorithms, NP-hard problems
4	Lai-Jiu Lin	Systems of variational inclusion problems and differential inclusion problems with applications.	J. Global Optimization	2009	DBLP DOI BibTeX RDF	Systems of variational inclusion problem, Systems of variational differential inclusion problems, Systems of equilibrium problems, Mathematical program with systems of variational differential inclusion constraints, Mathematical program with systems of equilibrium constraints
4	Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter	Applying Modular Decomposition to Parameterized Cluster Editing Problems.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Edge modification problems, Bicluster graphs, NP-complete problems, Fixed-parameter tractability, Cluster graphs
4	Lam Quoc Anh, Phan Quoc Khanh	Sensitivity analysis for multivalued quasiequilibrium problems in metric spaces: Hölder continuity of solutions.	J. Global Optimization	2008	DBLP DOI BibTeX RDF	Multivalued vector quasiequilibrium problems, Hölder continuity, Solution uniqueness, Quasivariational inequalities, Traffic network problems, Quasioptimization
4	Lam Quoc Anh, Phan Quoc Khanh	Various kinds of semicontinuity and the solution sets of parametric multivalued symmetric vector quasiequilibrium problems.	J. Global Optimization	2008	DBLP DOI BibTeX RDF	U-lower (or upper)-level closednesss, U-Hausdorff-lower (or upper)- level closedness, U-lower (or upper)-semicontinuity, U-Hausdorff-lower (or upper)-semicontinuity, (Hausdorff) lower or upper semicontinuity, U-inclusion property, Symmetric quasiequilibrium problems, Lower and upper bounded quasiequilibrium problems, Solution sets
4	Emmanuel Bresson, Jean Monnerat, Damien Vergnaud	Separation Results on the "One-More" Computational Problems.	CT-RSA	2008	DBLP DOI BibTeX RDF	“One-more” problems, Random self-reducible problems, Algebraic algorithms, Black-box reductions
4	Mira Kajko-Mattsson	Problems in agile trenches.	ESEM	2008	DBLP DOI BibTeX RDF	communication owner, oral communication, process related problems, product related problems, documentation, communication complexity
4	Kumara Sastry, Martin Pelikan, David E. Goldberg	Empirical analysis of ideal recombination on random decomposable problems.	GECCO	2007	DBLP DOI BibTeX RDF	additively-decomposable problems, ideal crossover, genetic algorithms, building blocks, empirical analysis, population sizing, convergence time, problem difficulty, test problems, scalability analysis
4	Jiah-Shing Chen, Yao-Tang Lin, Liang-Yu Chen	A Relation-Based Genetic Algorithm for Partitioning Problems with Applications.	IEA/AIE	2007	DBLP DOI BibTeX RDF	relational genetic algorithm (RGA), grouping genetic algorithm (GGA), relational encoding, grouping problems, partitioning problems
4	Yu-Chi Ho, Qing-Shan Jia, Qianchuan Zhao	The Equivalence between Ordinal Optimization in Deterministic Complex Problems and in Stochastic Simulation Problems.	Discrete Event Dynamic Systems	2006	DBLP DOI BibTeX RDF	Ordinal optimization, Deterministic complex problems, Stochastic simulation problems, Equivalence
4	Jeff Hartline, Alexa Sharp	An Incremental Model for Combinatorial Maximization Problems.	WEA	2006	DBLP DOI BibTeX RDF	online problems, analysis of algorithms, network analysis, combinatorial problems, approximation techniques
4	Oliver Kullmann	Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems.	Ann. Math. Artif. Intell.	2004	DBLP DOI BibTeX RDF	satisfiability problem (SAT), systems with partial instantiation, generalised resolution, lower bounds for resolution, upper bounds for SAT algorithms, automatisation of proof systems, generalised input resolution, generalised width restricted resolution, induced width of constraint satisfaction problems, constraint satisfaction problems, propositional logic, polynomial time hierarchies
4	Sándor P. Fekete, Rolf Klein, Andreas Nüchter	Searching with an autonomous robot.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	Kurt3D, competitive ration, online problems, three-dimensional laser scanning, visibility problems, watchman problems, searching, autonomous mobile robots
4	Zne-Jung Lee, Shun-Feng Su, Chou-Yuan Lee, Yao-Shan Hung	A Heuristic Genetic Algorithm for Solving Resource Allocation Problems.	Knowl. Inf. Syst.	2003	DBLP DOI BibTeX RDF	Genetic algorithm, Heuristics, Optimization problems, Resource allocation problems
4	Sounaka Mishra, Kripasindhu Sikdar	On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.	IFIP TCS	2000	DBLP DOI BibTeX RDF	NP-optimization problems, Minimaximal and maximinimal NP-optimization problems, L-reduction, Approximation algorithms, Hardness of approximation, APX-hardness
4	Kazunori Mizuno, Seiichi Nishihara	Local minimum structures of graph-coloring problems for stochastic constraint satisfaction algorithms.	ICTAI	2000	DBLP DOI BibTeX RDF	local minimum structures, stochastic constraint satisfaction, stochastic search algorithms, large-scale constraint satisfaction problems, locally minimal solutions, local constraint structures, LM pair, stochastic programming, operations research, graph colouring, hill-climbing, stepwise refinement, local minima, constraint theory, graph-coloring problems, graph-coloring problem
4	Dana Petcu	Solving Initial Value Problems with a Multiprocessor Code.	PaCT	1999	DBLP DOI BibTeX RDF	mathematical software supporting parallel processing, numerical solutions of large-scale problems, initial values problems for ordinary differential equations, performance analysis
4	Eddy Fromentin, Michel Raynal, Frederic Tronel	On Classes of Problems in Asynchronous Distributed Systems with Process Crashes.	ICDCS	1999	DBLP DOI BibTeX RDF	Broadcast Problems, Classes of Problems, Reduction Protocol, Fault-Tolerance, Consensus, Failure Detectors, Asynchronous Distributed Systems, Atomic Commitment
4	Francisco Facchinei, Joaquim Júdice, João Soares	Generating Box-Constrained Optimization Problems.	ACM Trans. Math. Softw.	1997	DBLP DOI BibTeX RDF	nonlinear programming test problems, test problems generation, optimization
4	Francisco Facchinei, Joaquim Júdice, João Soares	Algorithm 774: Fortran Subroutines for Generating Box-Constrained Optimization Problems.	ACM Trans. Math. Softw.	1997	DBLP DOI BibTeX RDF	nonlinear programming test problems, test problems generation, optimization, FORTRAN 77
4	Sanjeev Arora	Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems.	FOCS	1997	DBLP DOI BibTeX RDF	randomized polynomial time approximation, Euclidean TSP, optimum traveling salesman tour, Euclidean problems, nearly-linear time approximation, randomized, Steiner Tree, parallel implementations, randomised algorithms, geometric problems
4	Anup Kumar, Alok Srivastava, Aditi Singru, R. K. Ghosh	Robust and Distributed Genetic Algorithm for Ordering Problems. (PDF / PS)	HPDC	1996	DBLP DOI BibTeX RDF	ordering problems, consistent results, Distributed GA, simple crossover scheme, genetic algorithms, fault tolerance, distributed system, distributed algorithms, probability, travelling salesman problems, Traveling Salesman Problem, TSP, dynamic reconfiguration, mutation, crossover, operations research, distributed genetic algorithm
4	Levent V. Orman	Structural analysis of decision models.	HICSS	1995	DBLP DOI BibTeX RDF	computer based mathematical models, statistical problems, decision making problems, organizational model bases, micro structure, macro structure, complexity, constraints, decision support systems, abstraction, optimisation, statistical analysis, data models, decomposition, organizations, business data processing, optimization problems, structural analysis, decision models, mathematics computing
4	Leo Motus, R. Kinksaar, Tonu Naks, M. Pall	Enhancing object modelling technique with timing analysis capabilities.	ICECCS	1995	DBLP DOI BibTeX RDF	enhanced object modelling technique, timing analysis capabilities, timing correctness, software implementation problems, specification problems, time-constraint elicitation, Q-model, noncontradiction analysis, time modelling requirements, performance, software engineering, real-time systems, real-time systems, data integrity, timing, scheduling algorithms, timing constraints, object-oriented methods, consistency checking, application domain, integrity checking, design problems
4	Patrick L. Combettes	Constrained image recovery in a product space. (PDF / PS)	ICIP	1995	DBLP DOI BibTeX RDF	constrained image recovery, product space, feasibility set, quadratic minimization problems, convex minimization problems, parallel algorithms, parallel algorithms, image reconstruction, inverse problems, minimisation, cost function
4	Minze V. Chien, A. Yavuz Oruç	Adaptive Binary Sorting Schemes and Associated Interconnection Networks.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	adaptive binary sorting schemes, cost complexity, AKS sorting network, parallel algorithms, parallel processing, interconnection networks, sorting, communication complexity, binary sequences, concentration, permutation networks, routing problems, permutation problems, sorting problems
4	Biing-Feng Wang, Gen-Huey Chen	Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems.	IEEE Trans. Parallel Distrib. Syst.	1990	DBLP DOI BibTeX RDF	related graph problems, reconfigurable bus systems, parallel algorithms, graph theory, minimum spanning trees, bipartite graphs, transitive closure, transitive closure, connected components, processor arrays, undirected graph, bridges, biconnected components, graph problems, articulation points
4	Kwan Woo Ryu, Joseph JáJá	Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube.	IEEE Trans. Parallel Distrib. Syst.	1990	DBLP DOI BibTeX RDF	linear speedup, basic graph problems, tree expression evaluation, st-numbering, one-port communication, parallel algorithms, computational complexity, load balancing, graph theory, sorting, sorting, graph algorithms, biconnected components, list ranking, graph problems, hypercube algorithm, hypercube algorithms, ear decomposition
3	João Guilherme Sauer, Leandro dos Santos Coelho, Viviana Cocco Mariani, Luiza de Macedo Mourelle, Nadia Nedjah	A Discrete Differential Evolution Approach with Local Search for Traveling Salesman Problems.	Innovative Computing Methods and Their Applications to Engineering Problems	2011	DBLP DOI BibTeX RDF
3	Nguyen Quang Uy, Nguyen Xuan Hoai, Michael O'Neill, Bob McKay	Semantics based crossover for boolean problems.	GECCO	2010	DBLP DOI BibTeX RDF	boolean problems, genetic programming, crossover operators, trace semantics
3	Chung-Yao Chuang, Wen-Lian Hsu	Multivariate multi-model approach for globally multimodal problems.	GECCO	2010	DBLP DOI BibTeX RDF	global multimodality, globally multimodal problems, marginal product models, multi-model approach, genetic algorithms, evolutionary algorithms, evolutionary computation, estimation of distribution algorithms, ecga, extended compact genetic algorithm, edas
3	Christian Horoba, Dirk Sudholt	Ant colony optimization for stochastic shortest path problems.	GECCO	2010	DBLP DOI BibTeX RDF	combinatorial optimization, ant colony optimization, stochastic optimization, shortest path problems, running time analysis
3	Guy E. Blelloch, Kanat Tangwongsan	Parallel approximation algorithms for facility-location problems.	SPAA	2010	DBLP DOI BibTeX RDF	parallel algorithms, approximation algorithms, facility location problems
3	Manuel Bodirsky, Jens K. Mueller	The complexity of rooted phylogeny problems.	ICDT	2010	DBLP DOI BibTeX RDF	?-categorical structures, computational complexity, Datalog, constraint satisfaction problems, phylogenetic reconstruction
3	Reynold Bailey, Guy-Alain Amoussou, Tiffany Barnes, Hans-Peter Bischof, Thomas L. Naps	Relevant real-world undergraduate research problems: lessons from the nsf-reu trenches.	SIGCSE	2010	DBLP DOI BibTeX RDF	undergraduate research, computing problems
3	Grzegorz W. Wasilkowski, Henryk Wozniakowski	Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Average Case Setting.	Foundations of Computational Mathematics	2009	DBLP DOI BibTeX RDF	Multivariate linear problems, Finite-order weights, Small effective dimension, Average case setting, Polynomial-time algorithms, Tractability
3	Karl Svozil, Josef Tkadlec	On the solution of trivalent decision problems by quantum state identification.	Natural Computing	2009	DBLP DOI BibTeX RDF	Trivalent decision problems, Quantum decision problems, Quantum state identification, Generalized Deutsch problem, Quantum computation, Entanglement
3	Jorge Casillas, Pedro Martínez, Alicia D. Benítez	Learning consistent, complete and compact sets of fuzzy rules in conjunctive normal form for regression problems.	Soft Comput.	2009	DBLP DOI BibTeX RDF	Regression problems, Flexible fuzzy rules, Interpretability constrains, Multiobjective optimization, Genetic fuzzy systems
3	Hongfeng Wang, Dingwei Wang, Shengxiang Yang	A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems.	Soft Comput.	2009	DBLP DOI BibTeX RDF	Crossover-basedhill climbing, Mutation-based hill climbing, Dual mapping, Triggeredrandom immigrants, Genetic algorithm, Local search, Memetic algorithm, Dynamic optimization problems
3	Yujun Zheng, Chuanqing Xu, Jinyun Xue	A simple greedy algorithm for a class of shuttle transportation problems.	Optimization Letters	2009	DBLP DOI BibTeX RDF	Shuttle transportation problems, Combinatorial optimization, Greedy algorithm
3	Valeriano Antunes de Oliveira, Marko Antonio Rojas-Medar	Proper efficiency in vector infinite programming problems.	Optimization Letters	2009	DBLP DOI BibTeX RDF	Infinite programming problems, Multi-objective problems, Properly efficient solutions, Invexity
3	Sashka Davis, Russell Impagliazzo	Models of Greedy Algorithms for Graph Problems.	Algorithmica	2009	DBLP DOI BibTeX RDF	Graph optimization problems, Greedy algorithms, Priority algorithms
3	Thi Thu Van Nguyen, Jean-Jacques Strodiot, Van Hien Nguyen	The interior proximal extragradient method for solving equilibrium problems.	J. Global Optimization	2009	DBLP DOI BibTeX RDF	Interior proximal method, Logarithmic-quadratic proximal method, Extragradient method, Armijo-backtracking linesearch, Equilibrium problems
3	Longcheng Liu, Qin Wang	Constrained inverse min-max spanning tree problems under the weighted Hamming distance.	J. Global Optimization	2009	DBLP DOI BibTeX RDF	Min-max spanning tree, Inverse problems, Hamming distance, Strongly polynomial algorithms
3	Stanislaw Gawiejnowicz, Wieslaw Kurc, Lidia Pankowska	Conjugate problems in time-dependent scheduling.	J. Scheduling	2009	DBLP DOI BibTeX RDF	Time-dependent scheduling, Conjugate problems, Heuristic algorithms
3	Slimane Adjerid, Mahboub Baccouch	The Discontinuous Galerkin Method for Two-dimensional Hyperbolic Problems Part II: A Posteriori Error Estimation.	J. Sci. Comput.	2009	DBLP DOI BibTeX RDF	Hyperbolic problems, A posteriori error estimation, Discontinuous Galerkin method, Superconvergence
3	Hongfei Fu, Hongxing Rui	A Priori Error Estimates for Optimal Control Problems Governed by Transient Advection-Diffusion Equations.	J. Sci. Comput.	2009	DBLP DOI BibTeX RDF	Characteristic finite element, Advection-dominated diffusion equations, A priori error estimates, Optimal control problems
3	Yong Wang, Zixing Cai	A hybrid multi-swarm particle swarm optimization to solve constrained optimization problems.	Frontiers of Computer Science in China	2009	DBLP DOI BibTeX RDF	constrainthandling technique, particle swarm optimization, differential evolution, constrained optimization problems
3	Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister	Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently.	Discrete & Computational Geometry	2009	DBLP DOI BibTeX RDF	Interval problems, Convex hulls, Computational biology, Minkowski sums
3	Chris G. Baker, Ulrich Hetmaniuk, Richard B. Lehoucq, Heidi Thornquist	Anasazi software for the numerical solution of large-scale eigenvalue problems.	ACM Trans. Math. Softw.	2009	DBLP DOI BibTeX RDF	large-scale scientific computing, object-oriented programming, generic programming, numerical algorithms, Eigenvalue problems
3	Sebastian Dörn	Quantum Algorithms for Matching Problems.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Graph theory, Quantum algorithms, Matching problems
3	Tom Lenaerts, Anne Defaweux	Solving Hierarchically Decomposable Problems with the Evolutionary Transition Algorithm.	Natural Intelligence for Scheduling, Planning and Packing Problems	2009	DBLP DOI BibTeX RDF
3	S. M. Kamrul Hasan, Ruhul A. Sarker, Daryl Essam, David Cornforth	A Genetic Algorithm with Priority Rules for Solving Job-Shop Scheduling Problems.	Natural Intelligence for Scheduling, Planning and Packing Problems	2009	DBLP DOI BibTeX RDF
3	Thomas Weise, Alexander Podlich, Christian Gorldt	Solving Real-World Vehicle Routing Problems with Evolutionary Algorithms.	Natural Intelligence for Scheduling, Planning and Packing Problems	2009	DBLP DOI BibTeX RDF
3	Seung-Kyu Lee, Byung Ro Moon	Genetic algorithm with adaptive elitism-based immigrants for dynamic optimization problems.	GECCO	2009	DBLP DOI BibTeX RDF	adaptive elitism-based immigrants, elitism-based immigrants, genetic algorithms, dynamic optimization problems
3	Hisashi Handa	EDA-RL: estimation of distribution algorithms for reinforcement learning problems.	GECCO	2009	DBLP DOI BibTeX RDF	reinforcement learning problems, estimation of distribution algorithms, conditional random fields
3	André da Motta Salles Barreto, Douglas Adriano Augusto, Helio J. C. Barbosa	On the characteristics of sequential decision problems and their impact on evolutionary computation.	GECCO	2009	DBLP DOI BibTeX RDF	sequential decision problems, evolutionary computation, reinforcement learning
3	Zhi-hui Zhan, Jun Zhang 0003	Discrete Particle Swarm Optimization for Multiple Destination Routing Problems.	EvoWorkshops	2009	DBLP DOI BibTeX RDF	multiple destination routing problems, Particle swarm optimization (PSO), Steiner tree problem
3	Yinjie Sun	A Revised Neural Network for Solving Quadratic Programming Problems.	ISNN	2009	DBLP DOI BibTeX RDF	Quadratic Programming Problems, Neural Network, Analogue Circuit
3	Xuan Cai	Canonical Coin Systems for CHANGE-MAKING Problems.	HIS	2009	DBLP DOI BibTeX RDF	Change-Making problems, canonical coin systems, combinatorial problems
3	Chao-Li Sun, Jian-Chao Zeng, Jeng-Shyang Pan	An Improved Particle Swarm Optimization with Feasibility-Based Rules for Constrained Optimization Problems.	IEA/AIE	2009	DBLP DOI BibTeX RDF	Feasibility-based rules, Particle swarm optimization, constrained optimization problems
3	Srinivas Nedunuri, William R. Cook	Synthesis of fast programs for maximum segment sum problems.	GPCE	2009	DBLP DOI BibTeX RDF	segment-sum problems, algorithms, formal methods, branch-and-bound, program synthesis
3	Michael Hülsmann, Herbert Kopfer, Philip Cordes, Melanie Bloos	Collaborative Transportation Planning in Complex Adaptive Logistics Systems: A Complexity Science-Based Analysis of Decision-Making Problems of "Groupage Systems".	Complex	2009	DBLP DOI BibTeX RDF	Groupage Systems, Decision-making Problems, Complexity Science, Autonomous Cooperation, Collaboration, Logistics, Complex Adaptive Systems
3	Vladimir Dmitrievich Koshur, Dmitriy Kuzmin, Aleksandr Ivanovich Legalov, Kirill Pushkaryov	Solution of Large-Scale Problems of Global Optimization on the Basis of Parallel Algorithms and Cluster Implementation of Computing Processes.	PaCT	2009	DBLP DOI BibTeX RDF	large-scale problems solution, cluster, neural networks, optimization, global optimization
3	Martin Gebser, Benjamin Kaufmann, Torsten Schaub	Solution Enumeration for Projected Boolean Search Problems.	CPAIOR	2009	DBLP DOI BibTeX RDF
3	Philippe Laborie	IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems.	CPAIOR	2009	DBLP DOI BibTeX RDF	Scheduling, Constraint Programming
3	Tammar Shrot, Yonatan Aumann, Sarit Kraus	Easy and hard coalition resource game formation problems: a parameterized complexity analysis.	AAMAS	2009	DBLP DOI BibTeX RDF	coalition problems, parameterized complexity
3	Shannon Kennedy-Clark	Designing Failure to Encourage Success: Productive Failure in a Multi-user Virtual Environment to Solve Complex Problems.	EC-TEL	2009	DBLP DOI BibTeX RDF	Productive failure, complex problems, education, multi-user virtual environments
3	Roel Wieringa	Design science as nested problem solving.	DESRIST	2009	DBLP DOI BibTeX RDF	nested problems, practical problems, regulative cycle, design science
3	Ladislav Luksan, Ctirad Matonoha, Jan Vlcek	Algorithm 896: LSA: Algorithms for large-scale optimization.	ACM Trans. Math. Softw.	2009	DBLP DOI BibTeX RDF	discrete Newton methods, large-scale nonlinear least squares, large-scale nonlinear minimax, large-scale nonsmooth optimization, large-scale systems of nonlinear equations, limited-memory methods, partially separable problems, primal interior-point methods, sparse problems, quasi-Newton methods, Large-scale optimization
3	Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Mutsunori Banbara	Compiling finite linear CSP into SAT.	Constraints	2009	DBLP DOI BibTeX RDF	SAT encoding, Open-shop scheduling problems, Constraint satisfaction problems
3	Hisao Ishibuchi, Yasuhiro Hitotsuyanagi, Noritaka Tsukamoto, Yusuke Nojima	Use of biased neighborhood structures in multiobjective memetic algorithms.	Soft Comput.	2009	DBLP DOI BibTeX RDF	Multiobjective memetic algorithms, Flowshop scheduling problems, Evolutionary computation, Multiobjective optimization, Knapsack problems
3	Ernesto G. Birgin, José Mario Martínez	Marcos Raydan: Spectral Projected Gradient Methods.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Spectral projected gradient methods, Projected gradients, Nonmonotone line search, Convex constrained problems, Bound constrained problems, Spectral gradient method, Large scale problems
3	Robert W. Irving, David Manlove	Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Weak stability, Approximation algorithms, NP-hard problems, Stable matching
3	Robert W. Irving	Stable matching problems with exchange restrictions.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Matching, NP-complete problems, Stable marriage
3	Alan M. Frisch, Warwick Harvey, Christopher Jefferson, Bernadette Martínez Hernández, Ian Miguel	Essence : A constraint language for specifying combinatorial problems.	Constraints	2008	DBLP DOI BibTeX RDF	Specification languages, Constraint programming, Combinatorial problems, Constraint languages, Constraint modelling
3	Michael Laszlo, Sumitra Mukherjee	An approximation algorithm for network design problems with downwards-monotone demand functions.	Optimization Letters	2008	DBLP DOI BibTeX RDF	Spanning forests, Approximation algorithms, Integer programs, Network design problems
3	Antonino Maugeri, Fabio Raciti	On general infinite dimensional complementarity problems.	Optimization Letters	2008	DBLP DOI BibTeX RDF	Generalized complementarity problem, Lagrange function, Quasi-relative interior, Assumption (S), Continuous traffic network equilibrium problem, Random equilibrium problems, Optimality conditions
3	Elisabetta Allevi, Adriana Gnudi, Igor V. Konnov	An extended Gauss-Seidel method for a class of multi-valued complementarity problems.	Optimization Letters	2008	DBLP DOI BibTeX RDF	Multi-valued mappings, Off-diagonally antitone mappings, Gauss-Seidel algorithm, Complementarity problems
3	Jen-Da Shie, Shyi-Ming Chen	Feature subset selection based on fuzzy entropy measures for handling classification problems.	Appl. Intell.	2008	DBLP DOI BibTeX RDF	Membership grade, Fuzzy logic, Feature subset selection, Classification problems, Fuzzy entropy
3	Patrizia Daniele	Lagrange multipliers and infinite-dimensional equilibrium problems.	J. Global Optimization	2008	DBLP DOI BibTeX RDF	Separation theory, Quasi relative interior, Lagrange multipliers, Equilibrium problems
3	Annamaria Barbagallo	Regularity results for evolutionary nonlinear variational and quasi-variational inequalities with applications to dynamic equilibrium problems.	J. Global Optimization	2008	DBLP DOI BibTeX RDF	Traffic equilibrium problems, Time-dependent variational and quasi-variational inequalities, Continuity of solutions, Mosco’s convergence
3	Joana Dias, M. Eugénia V. Captivo, João C. N. Clímaco	A memetic algorithm for multi-objective dynamic location problems.	J. Global Optimization	2008	DBLP DOI BibTeX RDF	Genetic algorithms, Local search, Multi-objective, Location problems
3	Ferenc Domes, Arnold Neumaier	A scaling algorithm for polynomial constraint satisfaction problems.	J. Global Optimization	2008	DBLP DOI BibTeX RDF	Scaling algorithms, Optimization, Constraint satisfaction problems
3	Michelle Vallejos, Alfio Borzì	Multigrid optimization methods for linear and bilinear elliptic optimal control problems.	Computing	2008	DBLP DOI BibTeX RDF	elliptic optimal control problems, multigrid methods
3	Dilip Datta, Carlos M. Fonseca, Kalyanmoy Deb	A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems.	J. Scheduling	2008	DBLP DOI BibTeX RDF	Class timetabling, Land-use management, Evolutionary algorithm, Multi-objective optimization, Resource allocation problems
3	Víctor Domínguez, María-Luisa Rapún, Francisco-Javier Sayas	Dirac delta methods for Helmholtz transmission problems.	Adv. Comput. Math.	2008	DBLP DOI BibTeX RDF	Helmholtz transmission problems, quadrature methods, qualocation, Dirac delta, boundary integral equations
3	Ramesh Chand Mittal, Ruchi Nigam	Solution of a class of singular boundary value problems.	Numerical Algorithms	2008	DBLP DOI BibTeX RDF	Adomian decomposition, Singular boundary value problems
3	Rong Zhang, Zhong-Qing Wang, Ben-yu Guo	Mixed Fourier-Laguerre Spectral and Pseudospectral Methods for Exterior Problems Using Generalized Laguerre Functions.	J. Sci. Comput.	2008	DBLP DOI BibTeX RDF	Mixed Fourier-Laguerre orthogonal approximation and Gauss-type interpolation, Mixed spectral and pseudospectral methods for exterior problems
3	Ricardo P. Beausoleil, M. Gulnara Baldoquin, Rodolfo A. Montejo	Multi-start and path relinking methods to deal with multiobjective knapsack problems.	Annals OR	2008	DBLP DOI BibTeX RDF	Multiple objective metaheuristics, Multi-start methods, Knapsack problems, Path relinking
3	Weiguo Gao, Xiaoye S. Li, Chao Yang, Zhaojun Bai	An Implementation and Evaluation of the AMLS Method for Sparse Eigenvalue Problems.	ACM Trans. Math. Softw.	2008	DBLP DOI BibTeX RDF	Sparse eigenvalue problems, multilevel substructuring, performance evaluation
3	Anirban Mukherjee, Utpal Garain	A review of methods for automatic understanding of natural language mathematical problems.	Artif. Intell. Rev.	2008	DBLP DOI BibTeX RDF	Mathematical problems, Artificial intelligence, Natural language processing, Knowledge engineering, Automated reasoning
3	Pawel B. Myszkowski	Solving Scheduling Problems by Evolutionary Algorithms for Graph Coloring Problem.	Metaheuristics for Scheduling in Industrial and Manufacturing Applications	2008	DBLP DOI BibTeX RDF	Evolutionary Algorithms, Graph Coloring, Multiprocessor scheduling, Assignment Problems, Timetabling, Genetic Operators
3	Ignacio Araya, Bertrand Neveu, María-Cristina Riff	An Efficient Hyperheuristic for Strip-Packing Problems.	Adaptive and Multilevel Metaheuristics	2008	DBLP DOI BibTeX RDF	strip packing problems, low-level heuristic, hill climbing, Hyperheuristic
3	Cengiz Günay, Tomasz G. Smolinski, William W. Lytton, Thomas M. Morse, Padraig Gleeson, Sharon Crook, Volker Steuber, Angus Silver, Horatiu Voicu, Peter Andrews, Hemant Bokil, Hiren Maniar, Catherine Loader, Samar Mehta, David Kleinfeld, David J. Thomson, Partha P. Mitra, Gloster Aaron, Jean-Marc Fellous	Computational Intelligence in Electrophysiology: Trends and Open Problems.	Applications of Computational Intelligence in Biology	2008	DBLP DOI BibTeX RDF
3	Hugo Terashima-Marín, José Carlos Ortiz-Bayliss, Peter Ross, Manuel Valenzuela-Rendón	Hyper-heuristics for the dynamic variable ordering in constraint satisfaction problems.	GECCO	2008	DBLP DOI BibTeX RDF	dynamic variable ordering, evolutionary computation, constraint satisfaction problems, hyper-heuristics
3	Hisao Ishibuchi, Noritaka Tsukamoto, Yasuhiro Hitotsuyanagi, Yusuke Nojima	Effectiveness of scalability improvement attempts on the performance of NSGA-II for many-objective problems.	GECCO	2008	DBLP DOI BibTeX RDF	balance between diversity and convergence, crowding distance, pareto dominance, knapsack problems, evolutionary multiobjective optimization, many-objective optimization