On Finding the Maxima of a Set of Vectors
From MaRDI portal
Publication:4077449
Cited in
(only showing first 100 items - show all)- Scanline algorithms on a grid
- On local optima in multiobjective combinatorial optimization problems
- Rectilinear convex hull with minimum area
- Parallel skyline queries
- Single-machine scheduling with maintenance activities and rejection
- Lower bounds on probabilistic linear decision trees
- Approximating the Pareto optimal set using a reduced set of objective functions
- Linear space data structures for two types of range search
- Computation of spatial skyline points
- Dynamic layers of maxima with applications to dominating queries
- I/O-efficient 2-d orthogonal range skyline and attrition priority queues
- A new approach to the dynamic maintenance of maximal points in a plane
- Computing the vertices of tropical polyhedra using directed hypergraphs
- In-place algorithms for computing (Layers of) maxima
- A note on bicriterion programming
- Dynamic programming bi-criteria combinatorial optimization
- Specular sets
- Skyline Computation with Noisy Comparisons
- Maxima-finding algorithms for multidimensional samples: A two-phase approach
- Maintenance of configurations in the plane
- \textsc{MasterMovelets}: discovering heterogeneous movelets for multiple aspect trajectory classification
- A provably fast linear-expected-time maxima-finding algorithm
- Towards estimating expected sizes of probabilistic skylines
- Dynamic Planar Range Maxima Queries
- The agree concept lattice for multidimensional database analysis
- On the X-Y convex hull of a set of X-Y polygons
- On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination
- Fitting a two-joint orthogonal chain to a point set
- Faster output-sensitive skyline computation algorithm
- Generators, extremals and bases of max cones
- (Approximate) uncertain skylines
- Dominant skyline query processing over multiple time series
- Multiple voting location and single voting location on trees
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
- Output-sensitive peeling of convex and maximal layers
- On random cartesian trees
- A computational perspective of the role of the thalamus in cognition
- Solving efficiently the 0-1 multi-objective knapsack problem
- On the complexity of strongly connected components in directed hypergraphs
- A quantum adiabatic algorithm for multiobjective combinatorial optimization
- Fast linear expected-time algorithms for computing maxima and convex hulls
- Finding the intersection of two convex polyhedra
- How to improve a team's position in the FIFA ranking? A simulation study
- Random linear programs with many variables and few constraints
- Efficient optimally lazy algorithms for minimal-interval semantics
- Geometric containment and vector dominance
- Fast algorithms for computing the diameter of a finite planar set
- A tutorial on multiobjective optimization: fundamentals and evolutionary methods
- On the representation of the search region in multi-objective optimization
- Carbon-efficient scheduling of flow shops by multi-objective optimization
- Top-\(k\) Manhattan spatial skyline queries
- On the angle restricted nearest neighbor problem
- From proximity to utility: a Voronoi partition of Pareto optima
- On the definition and computation of rectilinear convex hulls
- A volume first maxima-finding algorithm
- Records, the maximal layer, and uniform distributions in monotone sets
- Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems
- Some dynamic computational geometry problems
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
- Representation of the non-dominated set in biobjective discrete optimization
- Searching for empty convex polygons
- On finding widest empty curved corridors
- On the parallel-decomposability of geometric problems
- Representation and management of MOEA populations based on graphs
- Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane
- The most-likely skyline problem for stochastic points
- Cost-efficiency analysis of weapon system portfolios
- Multiobjective interacting particle algorithm for global optimization
- Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach
- An efficient algorithm for the longest common palindromic subsequence problem
- On constant factors in comparison-based geometric algorithms and data structures
- Redundance-free description of partitioned complex systems
- Threshold rules for online sample selection
- Lower bounds for maximal and convex layers problems
- Efficient large-scale multi-drone delivery using transit networks
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3
- A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times
- K-Dominance in Multidimensional Data: Theory and Applications
- FlexiBO: A Decoupled Cost-Aware Multi-Objective Optimization Approach for Deep Neural Networks
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
- Computing the vector in the convex hull of a finite set of points having minimal length
- Non-dominated sorting methods for multi-objective optimization: review and numerical comparison
- A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
- scientific article; zbMATH DE number 7650102 (Why is no real title available?)
- An interactive decision support system for the bank courier routing problem
- Rectilinear convex hull of points in 3D and applications
- Fixed interval scheduling with third‐party machines
- Computing efficiently the nondominated subset of a set sum
- On a particular case of the multi-criteria unconstrained optimization problem
- Representing and Quantifying Rank - Change for the Web Graph
- A new method for the detection of protection faults in capability-based protection systems
- Comparisons between linear functions can help
- K-dominance in multidimensional data: theory and applications
- On the \(\mathcal{O}_\beta\)-hull of a planar point set
- Min‐sum controllable risk problems with concave risk functions of the same value range
- Skyline-join query processing in distributed databases
- New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
- Exact exponential algorithms for 3-machine flowshop scheduling problems
This page was built for publication: On Finding the Maxima of a Set of Vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4077449)
