Pages that link to "Item:Q1309040"
From MaRDI portal
The following pages link to Geometric algorithms and combinatorial optimization. (Q1309040):
Displaying 50 items.
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Designing two-echelon supply networks (Q859921) (← links)
- Computational study of large-scale \(p\)-median problems (Q868446) (← links)
- A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
- Scheduling orders for multiple product types to minimize total weighted completion time (Q881573) (← links)
- The probability of choosing primitive sets (Q884519) (← links)
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- Many 2-level polytopes from matroids (Q908212) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Packing and partitioning orbitopes (Q925263) (← links)
- A \({\mathsf{D}}\)-induced duality and its applications (Q925269) (← links)
- Tight results on minimum entropy set cover (Q926288) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- The wheels of the OLS polytope: Facets and separation (Q932687) (← links)
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (Q940879) (← links)
- Partitioning posets (Q943378) (← links)
- The travelling preacher, projection, and a lower bound for the stability number of a graph (Q951102) (← links)
- Computing robust basestock levels (Q951115) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- On the hardness of computing intersection, union and Minkowski sum of polytopes (Q958243) (← links)
- Computing regions of interest for geometric features in digital images (Q967405) (← links)
- On the tractability of coloring semirandom graphs (Q975431) (← links)
- The inverse Fermat-Weber problem (Q976390) (← links)
- Optimal routing in double loop networks (Q995561) (← links)
- Lattice-based treshold-changeability for standard CRT secret-sharing schemes (Q998654) (← links)
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits (Q1009176) (← links)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318) (← links)
- Minimum entropy coloring (Q1016051) (← links)
- On column generation formulations for the RWA problem (Q1025995) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- Fair welfare maximization (Q1031840) (← links)
- Mixed volume techniques for embeddings of Laman graphs (Q1037775) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Geometric algorithms and combinatorial optimization (Q1210712) (← links)
- Applications of semidefinite programming (Q1294557) (← links)
- The maximum deviation just-in-time scheduling problem. (Q1421459) (← links)
- Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- Linear-shaped partition problems (Q1577471) (← links)
- Mathematical problems for the next century (Q1582494) (← links)
- Spectral characterizations of the Lovász number and the Delsarte number of a graph (Q1592957) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- The polytope of degree sequences of hypergraphs (Q1611881) (← links)
- Energy-efficient scheduling and routing via randomized rounding (Q1617291) (← links)
- The mixed evacuation problem (Q1631682) (← links)
- Vertical perimeter versus horizontal perimeter (Q1643390) (← links)
- Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space (Q1644428) (← links)
- Matroid optimisation problems with nested non-linear monomials in the objective function (Q1646569) (← links)
- Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974) (← links)
