Multiobjective query optimization
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Norm-Based Approximation in Bicriteria Programming
Computational Optimization and Applications
Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models
Computational & Mathematical Organization Theory
Epsilon Dominance and Constraint Partitioningin Multiple Objective Problems
Journal of Global Optimization
An improved FPTAS for restricted shortest path
Information Processing Letters
Pareto Shortest Paths is Often Feasible in Practice
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
On Multicriteria Online Problems
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Resource Constrained Shortest Paths
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
The quickest path problem with interval lead times
Computers and Operations Research
Multi-cast ant colony system for the bus routing problem
Metaheuristics
Efficiently computing succinct trade-off curves
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Computers and Operations Research
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Competitive algorithms for the bicriteria k-server problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Integrated Routing and Scheduling of Hazmat Trucks with Stops En Route
Transportation Science
Finding a path subject to many additive QoS constraints
IEEE/ACM Transactions on Networking (TON)
Decision-making based on approximate and smoothed Pareto curves
Theoretical Computer Science
Multiconstrained QoS Routing: A Norm Approach
IEEE Transactions on Computers
Approximation schemes for a class of subset selection problems
Theoretical Computer Science
Succinct approximate convex pareto curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
Information Processing Letters
Near Admissible Algorithms for Multiobjective Search
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Efficiently Generating k-Best Solutions to Procurement Auctions
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Computers and Operations Research
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
International Journal of Applied Mathematics and Computer Science
An ant colony optimization algorithm for the bi-objective shortest path problem
Applied Soft Computing
On the bicriteria k-server problem
ACM Transactions on Algorithms (TALG)
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation algorithms for reliable stochastic combinatorial optimization
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximation schemes for multi-budgeted independence systems
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Solving QoS routing problems by DCA
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem**
Evolutionary Computation
Timetable information: models and algorithms
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Finding all attractive train connections by multi-criteria Pareto search
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
QoS routing algorithms using fully polynomial time approximation scheme
Proceedings of the Nineteenth International Workshop on Quality of Service
WaveMin: a fine-grained clock buffer polarity assignment combined with buffer sizing
Proceedings of the 48th Design Automation Conference
Efficient approximation algorithms for multi-objective constraint optimization
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Skynets: searching for minimum trees in graphs with incomparable edge weights
Proceedings of the 20th ACM international conference on Information and knowledge management
Routing with multiple quality-of-services constraints: An approximation perspective
Journal of Network and Computer Applications
Range query processing in multi-objective networks
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximating min-max (regret) versions of some polynomial problems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Decision making based on approximate and smoothed pareto curves
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Cost-Constrained minimum-delay multicasting
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
(Non)-approximability for the multi-criteria TSP(1, 2)
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Recent advances in multiobjective optimization
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Approximation with a fixed number of solutions of some biobjective maximization problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Finding representative systems for discrete bicriterion optimization problems
Operations Research Letters
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
Operations Research Letters
A Reference Point Approach for the Resource Constrained Shortest Path Problems
Transportation Science
International Journal of Bio-Inspired Computation
Approximation with a fixed number of solutions of some multiobjective maximization problems
Journal of Discrete Algorithms
The subdivision-constrained routing requests problem
Journal of Combinatorial Optimization
| Hi-index | 0.01 |