Pages that link to "Item:Q5915481"
From MaRDI portal
The following pages link to Combinatorial optimization. Theory and algorithms. (Q5915481):
Displayed 50 items.
- GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance (Q351554) (← links)
- Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
- Altruistically unbalanced kidney exchange (Q403725) (← links)
- Packing cycles exactly in polynomial time (Q421271) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros (Q501232) (← links)
- Enumeration of all wedged equilibrium configurations in contact problem with Coulomb friction (Q649238) (← links)
- Primal and dual predicted decrease approximation methods (Q681488) (← links)
- Approximation results for a min-max location-routing problem (Q765374) (← links)
- Pairwise kidney exchange (Q813943) (← links)
- Greedy-type resistance of combinatorial problems (Q865746) (← links)
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan (Q941557) (← links)
- The travelling preacher, projection, and a lower bound for the stability number of a graph (Q951102) (← links)
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming (Q961110) (← links)
- A novel iterative shape from focus algorithm based on combinatorial optimization (Q991937) (← links)
- A minimization version of a directed subgraph homeomorphism problem (Q1014308) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- Persistency and matroid intersection (Q1035281) (← links)
- Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685) (← links)
- A fast algorithm for the rectilinear distance location problem (Q1616792) (← links)
- On maximin share allocations in matroids (Q1628590) (← links)
- Efficient identification of link importance in dynamic networks (Q1660587) (← links)
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope (Q1662101) (← links)
- The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
- Properties of combinatorial optimization problems over polyhedral-spherical sets (Q1745702) (← links)
- A new greedy algorithm for the quadratic assignment problem (Q1940429) (← links)
- Maximum flows in generalized processing networks (Q2012883) (← links)
- Optimal matroid partitioning problems (Q2032344) (← links)
- Outer linear measure of connected sets via Steiner trees (Q2054562) (← links)
- Exact algorithms for finding constrained minimum spanning trees (Q2082219) (← links)
- Efficient approximation algorithms for maximum coverage with group budget constraints (Q2317355) (← links)
- Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
- On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)
- Least and most colored bases (Q2381817) (← links)
- The optimal solution set of the multi-source Weber problem (Q2414188) (← links)
- Additive stabilizers for unstable graphs (Q2419360) (← links)
- Graph kernels and Gaussian processes for relational reinforcement learning (Q2433177) (← links)
- Bike sharing systems: solving the static rebalancing problem (Q2445841) (← links)
- Heuristic for a new multiobjective scheduling problem (Q2463826) (← links)
- Parsimonious reduction of Gaussian mixture models with a variational-Bayes approach (Q2654252) (← links)
- A Protocol for Cutting Matroids Like Cakes (Q2937759) (← links)
- Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
- Online traveling salesman problems with service flexibility (Q3100693) (← links)
- Real-Time Optimal Time-Critical Target Assignment for UAVs (Q3564130) (← links)
- Online Vehicle Routing Problems: A Survey (Q3564358) (← links)
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem (Q5058727) (← links)
- (Q5136271) (← links)
- Mode Detection and Fault Diagnosis in Hybrid Systems (Q5237334) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- Restricted <i>b</i>‐factors in bipartite graphs and <i>t</i>‐designs (Q5471077) (← links)