scientific article; zbMATH DE number 3231692
From MaRDI portal
Publication:5519710
zbMath0143.41905MaRDI QIDQ5519710
Publication date: 1955
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Distribution-Free Consistent Independence Tests via Center-Outward Ranks and Signs, Maximum and optimal 1-2 matching problem of the different kind, On the Maximum of a Special Random Assignment Process, Efficient dual simplex algorithms for the assignment problem, Multilayer Modularity Belief Propagation to Assess Detectability of Community Structure, Index Matrices as a Cost Optimization Tool of Resource Provisioning in Uncertain Cloud Computing Environment, A separation between tropical matrix ranks, Recent Results and Open Problems in Evolutionary Multiobjective Optimization, Generalized XOR non-locality games with graph description on a square lattice, On Parameterised Quadratic Inverse Eigenvalue Problem, Smallest Singular Value Based Newton-Like Methods for Solving Quadratic Inverse Eigenvalue Problem, Unnamed Item, Structured Connectivity Augmentation, Label switching and its solutions for frequentist mixture models, A METRIC PROCEDURE FOR CARDINAL PREFERENCES, Unnamed Item, GERoMe – A Novel Graph Extraction Robustness Measure, Node Matching Computation Between Two Large Graphs in Linear Computational Cost, Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit Costs, Computational Studies of Randomized Multidimensional Assignment Problems, Decycling bipartite graphs, Structured Connectivity Augmentation, The minimal cost maximum matching of a graph, INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES, Semi-discrete optimal transport: hardness, regularization and numerical solution, A weight-scaling algorithm for \(f\)-factors of multigraphs, Double Flip Move for Ising Models with Mixed Boundary Conditions, Re‐identification in the Absence of Common Variables for Matching, Auction algorithm sensitivity for multi-robot task allocation, Dynamic pricing and matching in ride‐hailing platforms, Fast primal-dual update against local weight update in linear assignment problem and its application, Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis, Inferring the location of neurons within an artificial network from their activity, The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph, Multiplicative auction algorithm for approximate maximum weight bipartite matching, Minimum <scp>color‐degree</scp> perfect b‐matchings, The Capacitated and Economic Districting Problem, Representation learning for clustering via building consensus, Eine Erweiterung des Transportproblems, Perfect matching in bipartite hypergraphs subject to a demand graph, A Survey of the Generalized Assignment Problem and Its Applications, Entropic model predictive optimal transport over dynamical systems, Foundations of operations research: from linear programming to data envelopment analysis, Online voluntary mentoring: optimising the assignment of students and mentors, Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem, Boundary Labeling with Octilinear Leaders, A graph space optimal transport distance as a generalization of L p distances: application to a seismic imaging inverse problem, Sparse Models for Intrinsic Shape Correspondence, New algorithms for solving tropical linear systems, Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems, Unnamed Item, A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs, Santa Claus Meets Hypergraph Matchings, Causal inferences from many experiments, The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence, Parameterized complexity of categorical clustering with size constraints, Multi-Objective Evolutionary Algorithms: Past, Present, and Future, Finding real-valued single-source shortest paths in o(n 3) expected time, Improving a primal–dual simplex-type algorithm using interior point methods, Unnamed Item, Mobile Sensor Networks, Sokoban: Enhancing general single-agent search methods using domain knowledge, A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements, Unnamed Item, Unnamed Item, Optimality in transient markov chains and linear programming, Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning, Statistical solutions of hyperbolic systems of conservation laws: Numerical approximation, Some graph optimization problems with weights satisfying linear constraints, Computing the nucleolus of weighted cooperative matching games in polynomial time, An algorithm for then×n optimum assignment problem, Development and implementation of algorithms for vehicle routing during a no-notice evacuation, Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates, Mehar's Methods for Fuzzy Assignment Problems with Restrictions, Systems of representatives, Turbo‐SMT: Parallel coupled sparse matrix‐Tensor factorizations and applications, Vertex nomination via seeded graph matching, On Map Labeling with Leaders, Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems, A new algorithm for the assignment problem, Closing Gaps in Asymptotic Fair Division, Notes on Hazard-Free Circuits, Local Search Heuristics for the Multidimensional Assignment Problem, The Potential of Family-Free Genome Comparison, Scalable Semidefinite Programming, Unnamed Item, Unnamed Item, Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region, Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization, A Scalable Approach to Compute Delay Margin of a Class of Neutral-Type Time Delay Systems, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, A unified framework for primal-dual methods in minimum cost network flow problems, Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure, Empirical Regularized Optimal Transport: Statistical Theory and Applications, On Analyzing Cost Allocation Problems: Cooperation Building Structures and Order Problem Representations, Algorithms for finding a \(K\)th best valued assignment, Scaling algorithms for network problems, Analysis of ground state in random bipartite matching, Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets, A coupled ETAS-\(\mathrm{I}^{2}\)GMM point process with applications to seismic fault detection, Detecting almost symmetries of graphs, Improving the Hungarian assignment algorithm, A shortest augmenting path algorithm for dense and sparse linear assignment problems, The invisible hand algorithm: solving the assignment problem with statistical physics, Cluster-based sparse topical coding for topic mining and document clustering, Signal classification with a point process distance on the space of persistence diagrams, Local contrast as an effective means to robust clustering against varying densities, Primal-dual algorithms for the assignment problem, Dynamic algorithms via the primal-dual method, Monge sequences and a simple assignment algorithm, Max-min matching problems with multiple assignments, Entry and structures of interest groups in assignment games, From the bankruptcy problem and its concede-and-divide solution to the assignment problem and its fair division solution, A population-based algorithm for solving linear assignment problems with two objectives, Quality assurance laboratory planning system to maximize worker preference subject to certification and preference balance constraints, Tabu search and iterated local search for the cyclic bottleneck assignment problem, On the Euclidean assignment problem, Massively parallel augmenting path algorithms for the assignment problem, An efficient P-D algorithm for shortest path problem, Measuring distributional asymmetry with Wasserstein distance and Rademacher symmetrization, Scaling and structural condition numbers, The \(\beta\)-assignment problem in general graphs, An algorithm for solving an overdetermined tropical linear system using the analysis of stable solutions of subsystems, Reduction techniques providing initial groupings for Euclidean traveling salesman patching algorithms, A new algorithm for the assignment problem: An alternative to the Hungarian method, The ``largest element first heuristic for the maximization assignment problem, Time-cost tradeoff in a three-dimensional assignment problem, Error-free and best-fit extensions of partially defined Boolean functions, Efficient subgraph matching using topological node feature constraints, Approximation of graph edit distance based on Hausdorff matching, Matching based ground-truth annotation for online handwritten mathematical expressions, On maximum common subgraph problems in series-parallel graphs, Improving bipartite graph edit distance approximation using various search strategies, Interactive graph-matching using active query strategies, A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem, On characterizations of the probabilistic serial mechanism involving incentive and invariance properties, Gross substitutability: an algorithmic survey, Graph theoretic relaxations of set covering and set partitioning problems, Optimization methods for the train unit shunting problem, The study of group scheduling problems with general dual-position-based job processing times, Generic properties and control of linear structured systems: A survey, The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail, Motion tracking as a constrained optimization problem., Auction dynamics: a volume constrained MBO scheme, On coupling particle filter trajectories, Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints., Scheduling unrelated parallel machines to minimize total weighted tardiness., Linear programming based time lag identification in event sequences, Efficiency and time-cost-tradeoffs in transportation problems, The complexity of computing metric distances between partitions, A new adaptive Hungarian mating scheme in genetic algorithms, A marriage matching mechanism menagerie, The unit acquisition number of a graph, Revisiting the 0,1 assignment problem, Natalie 2.0: sparse global network alignment as a special case of quadratic assignment, The capacitated mobile facility location problem, Mallows and generalized Mallows model for matchings, The PRIMPING routine -- tiling through proximal alternating linearized minimization, Unsupervised group matching with application to cross-lingual topic matching without alignment information, On the transformation capability of feasible mechanisms for programmable matter, Critical objective function values in linear sum assignment problems, Single-machine scheduling with supporting tasks, Matching theory -- a sampler: From Dénes König to the present, Distributionally robust single machine scheduling with risk aversion, The algorithmic complexity of colour switching, Approximation algorithms for the max-buying problem with limited supply, Auction algorithms for network flow problems: A tutorial introduction, Due dates assignment and JIT scheduling with equal-size jobs, An augmenting path method for solving linear bottleneck assignment problems, A geometrical interpretation of the Hungarian method, Multiple objects tracking in fluorescence microscopy, An addendum on the incremental assignment problem, A scalable framework for cluster ensembles, Graph matching using the interference of continuous-time quantum walks, Jacobi's bound for independent systems of algebraic partial differential equations, Algorithms for maximum independent set in convex bipartite graphs, Matrix columns allocation problems, A neural network approach to solve the stable matching problem, An efficient algorithm for minimum-weight bibranching, Locomotive assignment with heterogeneous consists at CN North America, Maximum weight bipartite matching in matrix multiplication time, Heuristic and exact algorithms for the simultaneous assignment problem, Optimal movement of mobile sensors for barrier coverage of a planar region, The \(\beta\)-assignment problems, On finding trend-free block designs, An improved general procedure for lexicographic bottleneck problems, A variation of the assignment problem, An exterior point simplex algorithm for (general) linear programming problems, A case of non-convergent dual changes in assignment problems, Special cases of the traveling salesman problem, Packings by cliques and by finite families of graphs, Parallel algorithms for the assignment and minimum-cost flow problems, Computing Euclidean bottleneck matchings in higher dimensions, The auction algorithm: A distributed relaxation method for the assignment problem, An efficient labeling technique for solving sparse assignment problems, 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, A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness, Staffing problems with local network externalities, Improving stateful premise selection with transformers, Development and analysis of a sentence semantics representation model, The assignment problem revisited, mad-GP: automatic differentiation of Gaussian processes for molecules and materials, A multiscale semi-smooth Newton method for optimal transport, Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning, Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods, On approximation algorithm for orthogonal low-rank tensor approximation, The singly constrained assignment problem: An AP basis algorithm, Classes of linear programs solvable by coordinate-wise minimization, Priority inheritance with backtracking for iterative multi-agent path finding, A mathematical model of tonal function. I: Voice leadings, Computing the sequence of \(k\)-cardinality assignments, An efficient cost scaling algorithm for the assignment problem, A new pivoting strategy for Gaussian elimination, Fast similarity search for graphs by edit distance, Estimation of volatility causality in structural autoregressions with heteroskedasticity using independent component analysis, A look at the past and present of optimization - an editorial, A tale of three eras: the discovery and rediscovery of the Hungarian method, Simple matching vs linear assignment in scheduling models with positional effects: a critical review, The median routing problem for simultaneous planning of emergency response and non-emergency jobs, Methods for solving fuzzy assignment problems and fuzzy travelling salesman problems with different membership functions, An algorithm for identifying fair and optimal allocations, Synchronization problems in computer vision with closed-form solutions, A random effects stochastic block model for joint community detection in multiple networks with applications to neuroimaging, Recognizing interactive group activities using temporal interaction matrices and their Riemannian statistics, Preferences and the price of stability in matching markets, Molecular alignment as a penalized permutation Procrustes problem, Comparative statics in markets for indivisible goods, Optimal transportation between unequal dimensions, A linear assignment approach for the least-squares protein morphing problem, Algorithms and codes for dense assignment problems: The state of the art, An instance voting approach to feature selection, Exploiting partial correlations in distributionally robust optimization, The stable marriage problem: an interdisciplinary review from the physicist's perspective, Rényi 100, quantitative and qualitative (in)dependence, Solving an integrated scheduling and routing problem with inventory, routing and penalty costs, Finding efficient make-to-order production and batch delivery schedules, A two-stage solution approach for the directed rural postman problem with turn penalties, Distributionally robust scheduling on parallel machines under moment uncertainty, Location of facility based on simulated annealing and ``ZKW algorithms, The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases, Two-sided allocation problems, decomposability, and the impossibility of efficient trade, Algorithmic expedients for the \(S\)-labeling problem, An exact method for scheduling a yard crane, Integer programming models for the multidimensional assignment problem with star costs, MuRoCo: a framework for capability- and situation-aware coalition formation in cooperative multi-robot systems, Local search and constraint programming for the post enrolment-based course timetabling problem, Truthful unit-demand auctions with budgets revisited, A novel convex dual approach to three-dimensional assignment problem: theoretical analysis, Enriched spatial comparison of clusterings through discovery of deviating subspaces, Solving the aerial fleet refueling problem using group theoretic tabu search, Solving a combinatorial problem with network flows, Complexity results for flow-shop problems with a single server, Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers, An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem, Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration, A decomposition-based heuristic procedure for the medical student scheduling problem, Complexity of finding Pareto-efficient allocations of highest welfare, The balanced maximally diverse grouping problem with block constraints, Uncertain programming model for uncertain optimal assignment problem, A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer, Random assignment problems on \(2d\) manifolds, A quotient space formulation for generative statistical analysis of graphical data, Comparing high-dimensional partitions with the Co-clustering adjusted rand index, ROML: a robust feature correspondence approach for matching objects in a set of images, On improving matchings in trees, via bounded-length augmentations, Reliability-based fuzzy clustering ensemble, On the complexity and approximability of repair position selection problem, A dual approach to multi-dimensional assignment problems, One-dimensional service networks and batch service queues, Algorithms for fair \(k\)-clustering with multiple protected attributes, Complexity of linear minimization and projection on some sets, Stability of the tree of shapes to additive noise, A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices, Graph based twin cost matrices for unbalanced assignment problem with improved ant colony algorithm, A derived isometry theorem for sheaves, A labeling algorithm to solve the assignment problem, Speeding up the Hungarian algorithm, Almost mutually best in matching markets: rank gaps and size of the core, Joint optimization of an autoencoder for clustering and embedding, Role detection and prediction in dynamic political networks, Traveling salesman games with the Monge property, Optimizing consolidation processes in hubs: the hub-arrival-departure problem, Algorithm for the solution of the assignment problem for sparse matrices, Learning large \(Q\)-matrix by restricted Boltzmann machines, Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems, Learn from history for online bipartite matching, Fiber-to-object assignment heuristics, A review of the use of optimal transport distances for high resolution seismic imaging based on the full waveform, A time-triggered dimension reduction algorithm for the task assignment problem, Minimum structural sensor placement for switched linear time-invariant systems and unknown inputs, Machine learning assisted droplet trajectories extraction in dense emulsions, Computing valuations of the Dieudonné determinants, Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming, Optimal matching problem in detection and recognition performance evaluation, Optimal detection of the feature matching map in presence of noise and outliers, An alternate approach to solve two-level priority based assignment problem, Finding a complete matching with the maximum product on weighted bipartite graphs, Spoke contour conversion for coverage diagrams, A graph-based, multi-resolution algorithm for tracking objects in presence of occlusions, Design of Dynamic Algorithms via Primal-Dual Method, Transfers and exchange-stability in two-sided matching problems, Bi-Lipschitz bijection between the Boolean cube and the Hamming ball, The optimal tenement allocation for reducing traffic burden, Index Reduction via Unimodular Transformations, Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking, Community Detection in Temporal Multilayer Networks, with an Application to Correlation Networks, Jacobi's bound for a diffiety defined by a quasi-regular system, On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices, Linear-Time Approximation for Maximum Weight Matching, Attributed relational graph matching based on the nested assignment structure, A linguistic approach to classification of bacterial genomes, 3D model comparison using spatial structure circular descriptor, The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems, Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies, Optimal role and position assignment in multi-robot freely reachable formations, An exact branch-and-price approach for the medical student scheduling problem, Improved instance generation for kidney exchange programmes, Segmentation of three-dimensional images with parametric active surfaces and topology changes, Recovery of disrupted airline operations using \(k\)-maximum matching in graphs, Approximability of Two Variants of Multiple Knapsack Problems, A fast projected fixed-point algorithm for large graph matching, Task preference-based bottleneck assignment problem, Pallet location and job scheduling in a twin-robot system, An improved algorithm for two stage time minimization assignment problem, Some complexity and approximation results for coupled-tasks scheduling problem according to topology, Semi-supervised online structure learning for composite event recognition, A statistical model of cluster stability, ADM-CLE Approach for Detecting Slow Variables in Continuous Time Markov Chains and Dynamic Data, Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems, Multi-item Vickrey-English-Dutch auctions, A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation, Single-machine scheduling and due date assignment with rejection and position-dependent processing times, Ganzzahlige Programmierungen. Theorie und Anwendungen in der Praxis, Optimising sum-of-squares measures for clustering multisets defined over a metric space, Unnamed Item, Multiframe many-many point correspondence for vehicle tracking in high density wide area aerial videos, Detecting matrices of combinatorial rank three, Bi-criteria and approximation algorithms for restricted matchings, Expert judgments in the cost-effectiveness analysis of resource allocations: a case study in military planning, A sparse algorithm for dense optimal transport, Correlation function for the Grid-Poisson Euclidean matching on a line and on a circle, Research on solution space of bipartite graph vertex-cover by maximum matchings, Constrained target controllability of complex networks, 3/4-Discrete Optimal Transport, Geršgorin variations. III: On a theme of Brualdi and Varga, Near Approximation of Maximum Weight Matching through Efficient Weight Reduction, An extended assignment problem considering multiple inputs and outputs, Graph similarity scoring and matching, Fair referee assignments for professional football leagues, Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies, An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops, Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates, An algorithm for ranking assignments using reoptimization, Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs, Real-time content-aware image resizing, Assignment problems with changeover cost, Constrainedly fair job assignments under minimum wages, Unnamed Item, Exact solutions to a class of stochastic generalized assignment problems, Assignment problem with conflicts, Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms, On a conjecture by Gale about one-sided matching problems, An efficient approach for the rank aggregation problem, Modified Hungarian method for unbalanced assignment problem with multiple jobs, Ascending price Vickrey auctions, Side constraints and non-price attributes in markets, Sequential decision model for inference and prediction on nonuniform hypergraphs with application to knot matching from computational forestry, Hybrid Wasserstein distance and fast distribution clustering, A new algorithm for solving a special matching problem with a general form value function under constraints, Multi-agent coordination over local indexes via clique-based distributed assignment, Fair task allocation problem, Polyhedral results for position-based scheduling of chains on a single machine, Restricted set classification: who is there?, Borrowing strength and borrowing index for Bayesian hierarchical models, A priority based assignment problem, Integrality gap of the vertex cover linear programming relaxation, Uncertain random assignment problem, Similarity Indices for Spatia I Ecological Data, Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms, Approximation algorithms for the twin robot scheduling problem, Rössler-network with time delay: Univariate impulse pinning synchronization, Some aspects on solving transportation problem, Optimal assignments with supervisions, A priority based unbalanced time minimization assignment problem, Stable matchings with covering constraints: a complete computational trichotomy, An exact solution method for the capacitated item-sharing and crowdshipping problem, Properties of the \(d\)-dimensional Earth mover's problem, A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases, Addressing capacity uncertainty in resource-constrained assignment problems, \textit{Pin-Align}: a new dynamic programming approach to align protein-protein interaction networks, The hypergraph assignment problem, Suppression distance computation for hierarchical clusterings, Computing maximum non-crossing matching in convex bipartite graphs, Competitive strategies for an online generalized assignment problem with a service consecution constraint, A truck scheduling problem arising in intermodal container transportation, Variational texture synthesis with sparsity and spectrum constraints, Solving simultaneous target assignment and path planning efficiently with time-independent execution, Matching supply and demand for free-floating car sharing: on the value of optimization, Fair and Efficient Allocation of Scarce Resources Based on Predicted Outcomes: Implications for Homeless Service Delivery, Dynamic interaction feature selection based on fuzzy rough set, Excluding a planar matching minor in bipartite graphs, Denoising cosine similarity: a theory-driven approach for efficient representation learning, A memetic algorithm for deinterleaving pulse trains, Strategic oscillation for the balanced minimum sum-of-squares clustering problem, ToFU: topology functional units for deep learning, Statistical inference for persistent homology applied to simulated fMRI time series data, A generative model for texture synthesis based on optimal transport between feature distributions, Discrete Optimal Transport with Independent Marginals is #P-Hard, Learning latent and hierarchical structures in cognitive diagnosis models, On the Stability Region of Maximum Weighted Matching Server Allocation Policy, Efficient enumeration of the optimal solutions to the correlation clustering problem, Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages, Nash balanced assignment problem, A planner-optimal matching mechanism and its incentive compatibility in a restricted domain, Approximation algorithms for fair \(k\)-median problem without fairness violation, Simultaneous multi-graph learning and clustering for multiview data, Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching, On the Stability of Multigraded Betti Numbers and Hilbert Functions, ESTIMATING AND ENHANCING THE FEEDBACKABILITY OF COMPLEX NETWORKS, Lossy kernelization of same-size clustering, Recovery of disrupted airline operations using \(k\)-maximum matching in graphs
