The following pages link to Reverse search for enumeration (Q1917258):
Displaying 50 items.
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph (Q282748) (← links)
- Memory-efficient enumeration of constrained spanning trees (Q294700) (← links)
- A branch-price-and-cut algorithm for the minimum evolution problem (Q319451) (← links)
- On the number of anchored rectangle packings for a planar point set (Q344784) (← links)
- Mining preserving structures in a graph sequence (Q344786) (← links)
- A survey on enhanced subspace clustering (Q362155) (← links)
- New semidefinite programming relaxations for box constrained quadratic program (Q365811) (← links)
- Multi-way set enumeration in weight tensors (Q413829) (← links)
- Efficiently mining \(\delta \)-tolerance closed frequent subgraphs (Q413834) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
- Efficient enumeration of ordered trees with \(k\) leaves (Q441889) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data (Q508691) (← links)
- Code for polyomino and computer search of isospectral polyominoes (Q512885) (← links)
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (Q609569) (← links)
- A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization (Q631100) (← links)
- Efficient view point selection for silhouettes of convex polyhedra (Q634248) (← links)
- Amortized efficiency of generating planar paths in convex position (Q638510) (← links)
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems (Q643005) (← links)
- Reachability determination in acyclic Petri nets by cell enumeration approach (Q644287) (← links)
- The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
- Enumeration of all wedged equilibrium configurations in contact problem with Coulomb friction (Q649238) (← links)
- On reduction of duality gap in quadratic knapsack problems (Q693132) (← links)
- A linear optimization oracle for zonotope computation (Q824329) (← links)
- Enumeration of finite monomial orderings and combinatorics of universal Gröbner bases (Q840089) (← links)
- Reverse search for monomial ideals (Q840715) (← links)
- An efficient algorithm for solving pseudo clique enumeration problem (Q848935) (← links)
- An improved test set approach to nonlinear integer problems with applications to engineering design (Q887181) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- Setting port numbers for fast graph exploration (Q935169) (← links)
- On polyhedral projection and parametric programming (Q939122) (← links)
- Enumerating constrained non-crossing minimally rigid frameworks (Q946684) (← links)
- Algorithms for media (Q947070) (← links)
- Flips in planar graphs (Q950400) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
- Optimal complexity reduction of polyhedral piecewise affine systems (Q958262) (← links)
- Efficient enumeration of all ladder lotteries and its application (Q964388) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- Planar tree transformation: results and counterexample (Q975528) (← links)
- On the diameter of geometric path graphs of points in convex position (Q976134) (← links)
- Computing monotone disjoint paths on polytopes (Q1016050) (← links)
- Generalized pattern search methods for a class of nonsmooth optimization problems with structure (Q1023336) (← links)
- An occurrence of multiple projections in DEA-based measurement of technical efficiency: theoretical comparison among DEA models from desirable properties (Q1027569) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- Transforming spanning trees: A lower bound (Q1028225) (← links)
