The following pages link to Reinhardt Euler (Q367043):
Displayed 50 items.
- Item:Q367043 (redirect page) (← links)
- Item:Q198724 (redirect page) (← links)
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← links)
- On planar Toeplitz graphs (Q367045) (← links)
- Minimum \(H\)-decompositions of graphs: edge-critical case (Q414645) (← links)
- Replica symmetry of the minimum matching (Q431636) (← links)
- Sufficient conditions for a conjecture of Ryser about Hadamard circulant matrices (Q454829) (← links)
- Multiset variable representations and constraint propagation (Q481702) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above (Q492278) (← links)
- Optimization with uniform size queries (Q527424) (← links)
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- New models of the generalized minimum spanning tree problem (Q702364) (← links)
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
- Greedy algorithms for the minimization knapsack problem: average behavior (Q733910) (← links)
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044) (← links)
- Minimum deviation and balanced optimization: A unified approach (Q806674) (← links)
- Canonical equation sets for classes of concordant polytopes (Q811401) (← links)
- Distance irredundance and connected domination numbers of a graph (Q860459) (← links)
- Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs (Q868330) (← links)
- Star complements and exceptional graphs (Q876316) (← links)
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- Connected but not path-connected subspaces of infinite graphs (Q949760) (← links)
- On the completability of incomplete Latin squares (Q966163) (← links)
- Elementary properties of circle map sequences (Q1025759) (← links)
- The mixed cutting plane algorithm for all-integer programming (Q1092815) (← links)
- A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
- A new reduction method in integer programming (Q1115800) (← links)
- On the use of internal rate of return in linear and integer programming (Q1115802) (← links)
- A hybrid method for solving nonlinear knapsack problems (Q1123129) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
- Rank-axiomatic characterizations of independence systems (Q1144585) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← links)
- On a composition of independence systems by circuit identification (Q1186136) (← links)
- Adjacency of the best and second best valued solutions in combinatorial optimization problems (Q1314336) (← links)
- A recursive quadric programming algorithm that uses new nondifferentiable penalty functions (Q1333897) (← links)
- Optimal solution characterization for infinite positive semi-definite programming (Q1334827) (← links)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
- Two exact algorithms for the capacitated \(p\)-median problem (Q1421050) (← links)
- Packing of various radii solid spheres into a parallelepiped. (Q1421061) (← links)
- Coloring planar Toeplitz graphs and the stable set polytope. (Q1422423) (← links)
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming (Q1591595) (← links)
- Some results on node lifting of TSP inequalities (Q1592839) (← links)
- Simplicial pivoting algorithms for a tractable class of integer programs (Q1598876) (← links)
- Exceptional times of the critical dynamical Erdős-Rényi graph (Q1617126) (← links)
- On Latin squares and the facial structure of related polytopes (Q1820162) (← links)
- Linear optimization and extensions (Q1892405) (← links)