scientific article; zbMATH DE number 3793772
From MaRDI portal
Publication:4739657
Cited in
(only showing first 100 items - show all)- Active set algorithms for isotonic regression; a unifying framework
- Computing the bipartite edge frustration of fullerene graphs
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Geometric Knapsack problems
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Some results concerning post-infeasibility analysis
- Shortest paths without a map
- Adaptive tabu search for course timetabling
- Sums of idempotents and logarithmic residues in zero pattern matrix algebras
- Solving H-horizon, stationary Markov decision problems in time proportional to log (H)
- Hybrid constructive heuristics for the critical node problem
- Weighted digraphs and tropical cones
- Representations of votes facilitating monotonicity-based ranking rules: from votrix to votex
- Reverse search for enumeration
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Strong regularity of matrices -- a survey of results
- On-line algorithms for weighted bipartite matching and stable marriages
- Temporal constraint networks
- Ant colony optimization theory: a survey
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- The complexity of facets (and some facets of complexity)
- Resource allocation under limited sharing
- Approximation algorithms for indefinite quadratic programming
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints
- Heuristic and exact algorithms for the simultaneous assignment problem
- Repairing high school timetables with polymorphic ejection chains
- A survey of very large-scale neighborhood search techniques
- Auction algorithms for network flow problems: A tutorial introduction
- On visualization scaling, subeigenvectors and Kleene stars in max algebra
- The hierarchical network design problem
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- A new mathematical model for tiling finite regions of the plane with polyominoes
- Using Approximation Algorithms to Build Evidence Factors and Related Designs for Observational Studies
- Graph properties checkable in linear time in the number of vertices
- On the maximum size of Erdős-Ko-Rado sets in \(H(2d+1, q^2)\)
- Exact credal treatment of missing data
- An integer programming problem and rank decomposition of block upper triangular matrices
- The traveling salesman problem: An overview of exact and approximate algorithms
- Dealing with label switching in mixture models under genuine multimodality
- Converting triangulations to quadrangulations
- The complexity of determining a shortest cycle of even length
- Scaling algorithms for network problems
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- The \(Multi\)-SAT algorithm
- Single machine scheduling with two competing agents and equal job processing times
- DNA solution of integer linear programming
- The logarithmic HLS inequality for systems on compact manifolds
- The general maximum matching algorithm of Micali and Vazirani
- The complexity of facets resolved
- A primal-dual interior point method whose running time depends only on the constraint matrix
- Selfish unsplittable flows
- A linear time algorithm for graph partition problems
- Scheduling jobs with fixed start and end times
- The nucleolus of balanced simple flow networks
- An effective hybrid algorithm for university course timetabling
- Generalized probabilistic satisfiability
- The minimum shift design problem
- On the robust shortest path problem.
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Two phase algorithms for the bi-objective assignment problem
- Characterizations of consistent marked graphs
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- Dual coordinate step methods for linear network flow problems
- Finding a complete matching with the maximum product on weighted bipartite graphs
- Formulating logical implications in combinatorial optimisation
- On the complexity and approximation of syntenic distance
- \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems
- Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
- Graph colourings and partitions
- An Exact Distribution-Free Test Comparing Two Multivariate Distributions based on Adjacency
- Timetable construction: the algorithms and complexity perspective
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
- A state-of-the-art review of parallel-machine scheduling research
- Solving a cutting-stock problem with the constraint logic programming language CHIP
- Variable neighborhood search: Principles and applications
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
- Project scheduling under competition
- The complexity of resource allocation and price mechanisms under bounded rationality
- Optimization and testing in linear non‐Gaussian component analysis
- How easy is local search?
- Optimal resource allocation with minimum activation levels and fixed costs
- Future paths for integer programming and links to artificial intelligence
- On the solution of concave knapsack problems
- Asymptotics for transportation cost in high dimensions
- On the polyhedral complexity of the integer points in a hyperball
- On the complexity of generalized due date scheduling problems
- The uniquely solvable bipartite matching problem
- A dynamic location problem for graphs
- On finding optimal and near-optimal lineal spanning trees
- The auction algorithm: A distributed relaxation method for the assignment problem
- GRAFT, a complete system for data fusion
- A general trimming approach to robust cluster analysis
- k-sum optimization problems
- On the stability of asynchronous iterative processes
- Experimental study on approximation algorithms for guarding sets of line segments
- Computational complexity of convoy movement planning problems
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- A quasiconcave minimization method for solving linear two-level programs
- Local optimization on graphs
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)
