scientific article; zbMATH DE number 3793772
From MaRDI portal
Publication:4739657
Cited in
(only showing first 100 items - show all)- Maximum bipartite matchings with low rank data: locality and perturbation analysis
- Optimal strategies for some team games
- Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
- Routing trains through railway stations: Complexity issues
- A theory of complexity for continuous time systems
- Multitask n-vehicle exploration problem: complexity and algorithm
- Algorithm unions for solving discrete optimization problems
- On the regularity of matrices in min algebra
- Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
- A unifying approach to heuristic search
- Simultaneous mesh generation and partitioning for Delaunay meshes
- Geometric algorithms for finding a point in the intersection of balls
- A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts
- A review of two network curvature measures
- Parallel and sequential approximation of shortest superstrings
- A new and improved algorithm for the 3-cut problem
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
- On the stability of asynchronous iterative processes
- Complexity and algorithms for nonlinear optimization problems
- Construction of a technologically feasible cutting with pierce points placement constraints
- Lagrangian bounds from decision diagrams
- An analysis of a decomposition heuristic for the assignment problem
- A set covering reformulation of the pure fixed charge transportation problem
- Performance evaluation of evolutionary class of algorithms -- an application to 0-1 knapsack problem
- Une procédure de purification pour les problèmes de complémentarité linéaire, monotones
- A framework for the complexity of high-multiplicity scheduling problems
- Eigenvectors of interval matrices over max--plus algebra
- On the power of neural networks for solving hard problems
- Extension of M-convexity and L-convexity to polyhedral convex functions
- Concerning the achromatic number of graphs
- A condition for the strong regularity of matrices in the minimax algebra
- Scheduling dedicated jobs with variative processing times
- Decomposition representations of logical equations in problems of inversion of discrete functions
- Stable marriage and indifference
- Disturbance rejection control based on state-reconstruction and persistence disturbance estimation
- Dynamic algorithms for shortest paths in planar graphs
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
- A generalized hypergreedy algorithm for weighted perfect matching
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- A new adaptive Hungarian mating scheme in genetic algorithms
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- Local ratio with negative weights.
- An improved iterative reconstruction algorithm for traveltime tomography
- An intelligent agent negotiation strategy in the electronic marketplace environment
- Discriminating Codes in Geometric Setups
- On matroids and hierarchical graphs
- Algorithms to construct a mathematical model of preferences using expert judgments
- On Minimum Critically n-Edge-Connected Graphs
- Parallel single grid and multigrid solution of industrial compressible flow problems
- Two-variable linear programming in parallel
- A Variable-Complexity Norm Maximization Problem
- Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect
- Zonotopes and the LP-Newton method
- A primal-dual approximation algorithm for generalized Steiner network problems
- Shortest path problems with node failures
- On the frontiers of polynomial computations in tropical geometry
- Strong linear independence in bottleneck algebra
- The Monge-Ampère-Kantorovich approach to reconstruction in cosmology
- A new approach to the learning effect: Beyond the learning curve restrictions
- Scheduling unit-time jobs on processors with different capabilities
- Approximating shortest superstrings with constraints
- A measure-theoretical max-flow-min-cut problem
- Non-oblivious local search for graph and hypergraph coloring problems
- Statistical mechanics methods and phase transitions in optimization problems
- A note on the approximation of the MAX CLIQUE problem
- Finding approximate solutions to NP-hard problems by neural networks is hard
- A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
- Communication complexity of convex optimization
- On the complexity of incremental computation
- A method for approximating pairwise comparison matrices by consistent matrices
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- Performance of linear-space search algorithms
- Path-matching problems
- Mapping tree-structured combinatorial optimization problems onto parallel computers
- Parallel approximation of optimization problems
- Parallel best-first branch-and-bound in discrete optimization: a framework
- Performances of parallel branch and bound algorithms with best-first search
- A fast algorithm for locating supplying center on a lattice
- Asymptotics for transportation cost in high dimensions
- Randomized methods for the number partitioning problem
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
- Quantifiers and approximation
- Canonical bases in linear programming
- An efficient distributed algorithm for maximum matching in general graphs
- New algorithms for pattern matching with wildcards and length constraints
- On time-optimal trajectories in non-uniform mediums
- A feasibly constructive lower bound for resolution proofs
- ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM
- Self-configuring Nature Inspired Algorithms for Combinatorial Optimization Problems
- Globally solving a nonlinear UAV task assignment problem by stochastic and deterministic optimization approaches
- The subdivision-constrained minimum spanning tree problem
- Design of the ATM-based interconnecting network of the access segment of future cellular systems
- Distributed asynchronous computation of fixed points
- Computing the bump number is easy
- Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
- Some theoretical challenges in digital geometry: a perspective
- Lower bounds for resolution and cutting plane proofs and monotone computations
- On the computational complexity of combinatorial flexibility problems
- Fractional matchings and the Edmonds-Gallai theorem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739657)
