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