The following pages link to (Q3214706):
Displaying 36 items.
- Approximate algorithms for some generalized knapsack problems (Q1238705) (← links)
- Almost integral polyhedra related to certain combinatorial optimization problems (Q1240148) (← links)
- A network solution to a general vehicle scheduling problem (Q1242094) (← links)
- Branching from the largest upper bound. Folklore and facts (Q1247917) (← links)
- Simplification of Boolean-valued data by minimum covering (Q1247950) (← links)
- A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems (Q1255881) (← links)
- Cutting-plane theory: Algebraic methods (Q1257827) (← links)
- Implied constraints and an alternate unified development of nonlinear programming theory (Q1266624) (← links)
- A relation between the knapsack and group knapsack problems (Q1270786) (← links)
- A gentle introduction to Numerica (Q1274762) (← links)
- Simple Lagrangian heuristic for the set covering problem (Q1278602) (← links)
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem (Q1309925) (← links)
- Two simple applications of the unmodularity property (Q1318659) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- A binary integer linear program with multi-criteria and multi-constraint levels (Q1373885) (← links)
- On aggregating two linear diophantine equations (Q1383381) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- A number theoretic reformulation and decomposition method for integer programming (Q1394028) (← links)
- Use of location-allocation models in health service development planning in developing nations (Q1572964) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- An algorithm for set covering problem (Q1823139) (← links)
- Single value simulation of fuzzy variable - some further results (Q1823920) (← links)
- A simple, all primal branch and bound approach to pure and mixed integer binary programs (Q1835845) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- A heuristic solution procedure for multicommodity integer flows (Q1905088) (← links)
- Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming (Q1929504) (← links)
- The additivity and dummy axioms in the discrete cost sharing model (Q1960378) (← links)
- Valid integer polytope (VIP) penalties for branch-and-bound enumeration (Q1977646) (← links)
- Optimal data placement on networks with a constant number of clients (Q2453166) (← links)
- A goal programming approach to solve linear fractional multi-objective set covering problem. (Q2476423) (← links)
- A Stackelberg equilibrium for a missile procurement problem (Q2519103) (← links)
- Gomory cuts revisited (Q2564234) (← links)
- A Linearization technique for solving the quadratic set covering problem (Q4331991) (← links)
- Properties of vertex packing and independence system polyhedra (Q4766816) (← links)
- On the facial structure of set packing polyhedra (Q5181532) (← links)
- Polyhedral methods for piecewise-linear functions. I: The lambda method (Q5929311) (← links)
