scientific article; zbMATH DE number 3231692
From MaRDI portal
Publication:5519710
zbMath0143.41905MaRDI QIDQ5519710
No author found.
Publication date: 1955
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
A hybrid genetic algorithm for the three-index assignment problem ⋮ Optimum matchings in weighted bipartite graphs ⋮ Point clustering via voting maximization ⋮ Minimum cost input/output design for large-scale linear structural systems ⋮ Optimum distance flag codes from spreads via perfect matchings in graphs ⋮ Regularization of DAEs based on the signature method ⋮ Euclidean maximum matchings in the plane -- local to global ⋮ Minimum-cost load-balancing partitions ⋮ Solving house allocation problems with risk-averse agents ⋮ Prioritizing replenishments of the piece picking area ⋮ Distributed coordination of emergency medical service for angioplasty patients ⋮ Two exact algorithms for the traveling umpire problem ⋮ Solving the traveling repairman problem on a line with general processing times and deadlines ⋮ Cautious label ranking with label-wise decomposition ⋮ The partitioning min-max weighted matching problem ⋮ The parallel stack loading problem to minimize blockages ⋮ A survey on single crane scheduling in automated storage/retrieval systems ⋮ Assignment problems: a golden anniversary survey ⋮ Rényi divergence minimization based co-regularized multiview clustering ⋮ A sparse multiscale algorithm for dense optimal transport ⋮ The assignment problem with nearly Monge arrays and incompatible partner indices ⋮ A redistricting problem applied to meter reading in power distribution networks ⋮ Stochastic resource allocation using a predictor-based heuristic for optimization via simulation ⋮ Local search heuristics for the mobile facility location problem ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Distributed fair allocation of indivisible goods ⋮ Bilevel time minimizing assignment problem ⋮ Stochastic enumeration method for counting NP-hard problems ⋮ Incremental assignment problem ⋮ Traffic assignment in communication satellites ⋮ Bayesian object matching ⋮ König-Egerváry graphs are non-Edmonds ⋮ Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm ⋮ A comprehensive study of an online packet scheduling algorithm ⋮ A general approach to the measurement of change in fuzzy concept lattices ⋮ Globally optimal joint image segmentation and shape matching based on Wasserstein modes ⋮ An efficient algorithm for computing the distance between close partitions ⋮ Evolutionary dynamics and equitable core selection in assignment games ⋮ Maximum travelling salesman problem. I ⋮ Kernel functions for case-based planning ⋮ Resampling approach for cluster model selection ⋮ Optimal Sokoban solving using pattern databases with specific domain knowledge ⋮ Quotient geometric crossovers and redundant encodings ⋮ Spatio-temporal multi-robot routing ⋮ Optimizing restriction site placement for synthetic genomes ⋮ A solution of the affine quadratic inverse eigenvalue problem ⋮ Defect detection using feature point matching for non-repetitive patterned images ⋮ Graph matching by simplified convex-concave relaxation procedure ⋮ A post-improvement procedure for the mixed load school bus routing problem ⋮ An application of the minimal spanning tree approach to the cluster stability problem ⋮ The traveling salesman problem with flexible coloring ⋮ Mapping workflow applications with types on heterogeneous specialized platforms ⋮ Optimal assignment of resources to strengthen the weakest link in an uncertain environment ⋮ The auction algorithm for the transportation problem ⋮ Characterizing complex particle morphologies through shape matching: descriptors, applications, and algorithms ⋮ Approximately fair cost allocation in metric traveling salesman games ⋮ Goal programming in the context of the assignment problem and a computationally effective solution method ⋮ Convex recolorings of strings and trees: Definitions, hardness results and algorithms ⋮ Simultaneous matchings: Hardness and approximation ⋮ Quadratic nonnegative matrix factorization ⋮ Improved filtering for weighted circuit constraints ⋮ Matrices commuting with a given normal tropical matrix ⋮ Using local similarity measures to efficiently address approximate graph matching ⋮ Minimum many-to-many matchings for computing the distance between two sequences ⋮ A heuristic for the time constrained asymmetric linear sum assignment problem ⋮ Campaign management under approval-driven voting rules ⋮ On complexity of special maximum matchings constructing ⋮ Random assignment problems ⋮ A genuinely polynomial primal simplex algorithm for the assignment problem ⋮ Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized ⋮ Graph editing problems with extended regularity constraints ⋮ Privacy by diversity in sequential releases of databases ⋮ On voting-based consensus of cluster ensembles ⋮ A distance measure for large graphs based on prime graphs ⋮ A reduction approach to the repeated assignment problem ⋮ Repulsive assignment problem ⋮ Local search heuristics for the multidimensional assignment problem ⋮ Boundary labeling with octilinear leaders ⋮ Local ratio with negative weights. ⋮ Tropical linear maps on the plane ⋮ The multi-shift vehicle routing problem with overtime ⋮ Scheduling two-machine no-wait open shops to minimize makespan ⋮ Scheduling preemptive open shops to minimize total tardiness ⋮ A hybrid scatter search heuristic for personalized crew rostering in the airline industry ⋮ Fast algorithms for placing large entries along the diagonal of a sparse matrix ⋮ Metrics and barycenters for point pattern data ⋮ An on-line assignment problem with random effectiveness and costly information ⋮ A diagonal completion and 2-optimal procedure for the travelling salesman problem ⋮ On the identifiability of Bayesian factor analytic models ⋮ Partial-matching RMS distance under translation: combinatorics and algorithms ⋮ Approximation algorithms for the bus evacuation problem ⋮ Heuristics for the mixed swapping problem ⋮ Bayesian clustering of replicated time-course gene expression data with weak signals ⋮ On dual solutions of the linear assignment problem ⋮ An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem ⋮ A facet generation and relaxation technique applied to an assignment problem with side constraints ⋮ Complexity of the min-max and min-max regret assignment problems ⋮ Establishing motion correspondence using extended temporal scope ⋮ An evolutionary heuristic algorithm for the assignment problem ⋮ Random partition models and complementary clustering of Anglo-Saxon place-names
This page was built for publication:
