Pages that link to "Item:Q1181917"
From MaRDI portal
The following pages link to An interior point algorithm to solve computationally difficult set covering problems (Q1181917):
Displaying 25 items.
- Improved solutions to the Steiner triple covering problem (Q293185) (← links)
- A continuous approach to inductive inference (Q687090) (← links)
- A biased random-key genetic algorithm for the Steiner triple covering problem (Q691474) (← links)
- Computational experience with an interior point algorithm on the satisfiability problem (Q753688) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- An intelligent algorithm for mixed-integer programming models (Q1206379) (← links)
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid (Q1278289) (← links)
- Investigation of path-following algorithms for signomial geometric programming problems (Q1280139) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach (Q1330807) (← links)
- Potential reduction algorithms for structured combinatorial optimization problems (Q1373458) (← links)
- A potential reduction approach to the frequency assignment problem (Q1377670) (← links)
- Trust region affine scaling algorithms for linearly constrained convex and concave programs (Q1380941) (← links)
- The design of a 0-1 integer optimizer and its application in the Carmen system (Q1390346) (← links)
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling (Q1897393) (← links)
- Matrix representation and gradient flows for NP-hard problems (Q1906756) (← links)
- An approach to guided learning of Boolean functions (Q1910784) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
- Solving hard set covering problems (Q1924619) (← links)
- Solving large Steiner Triple Covering Problems (Q2275579) (← links)
- A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
- Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem (Q6114784) (← links)
