The following pages link to (Q3214706):
Displayed 50 items.
- On the distribution of the domination number for random class cover catch digraphs (Q158221) (← links)
- Parametric-objective integer programming using knapsack facets and Gomory cutting planes (Q579128) (← links)
- A computational comparison of Gomory and knapsack cuts (Q580177) (← links)
- A forward algorithm and planning horizon procedure for the production smoothing problem without inventory (Q595502) (← links)
- A successful algorithm for solving directed Hamiltonian path problems (Q788642) (← links)
- Optimal weighing designs with a string property (Q792048) (← links)
- An algorithm of internal feasible directions for linear integer programming (Q809890) (← links)
- Computing leximin-optimal solutions in constraint networks (Q835811) (← links)
- A note on the m-center problem with rectilinear distances (Q913636) (← links)
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- Production-inventory games: A new class of totally balanced combinatorial optimization games (Q1002332) (← links)
- Choosing robust solutions in discrete optimization problems with fuzzy costs (Q1037888) (← links)
- Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
- Capital budgeting with Benders' decomposition (Q1062887) (← links)
- An algorithm for the periodic solutions in the knapsack problem (Q1075253) (← links)
- An algorithm for the bi-criterion integer programming problem (Q1075952) (← links)
- Optimal and heuristic algorithms for multiproduct uncapacitated facility location (Q1076603) (← links)
- On equivalent knapsack problems (Q1082265) (← links)
- A simple strategy for solving a class of 0-1 integer programming models (Q1090232) (← links)
- Structural analysis of local search heuristics in combinatorial optimization (Q1095797) (← links)
- Adding activities to the dual instead of cuts to the primal problem (Q1097165) (← links)
- A parallel integer linear programming algorithm (Q1098778) (← links)
- A shadow price in integer programming for management decision (Q1107446) (← links)
- A unified approach for price directive decomposition procedures in integer programming (Q1109677) (← links)
- Pick-and-choose heuristics for partial set covering (Q1122585) (← links)
- Comments on practical implementation of Gomory's fractional algorithm (Q1134628) (← links)
- Continued fractions and explicit solutions of a particular discrete optimization problem (Q1136694) (← links)
- Levelling terrain trees: A transshipment problem (Q1145618) (← links)
- Related necessary conditions for completing partial latin squares (Q1145701) (← links)
- Some aspects of integer programming duality (Q1148793) (← links)
- Discrete extremal problems (Q1152306) (← links)
- A separable integer programming problem equivalent to its continual version (Q1152307) (← links)
- Adjacent vertices on the b-matching polyhedron (Q1156817) (← links)
- On maintenance scheduling of production units (Q1159562) (← links)
- Optimal assignment of broadcasting frequencies (Q1159572) (← links)
- An algorithm for the multiple objective integer linear programming problem (Q1160567) (← links)
- A transfer algorithm for hierarchical clustering (Q1163824) (← links)
- Identification of non-optimal arcs for the traveling salesman problem (Q1165781) (← links)
- A heuristic decomposition approach to optimal control in a water supply model (Q1167069) (← links)
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations (Q1169409) (← links)
- An interactive dynamic programming approach to multicriteria discrete programming (Q1169938) (← links)
- A characterisation of all feasible solutions to an integer program (Q1171507) (← links)
- Locational analysis (Q1173002) (← links)
- An extension of a greedy heuristic for the knapsack problem (Q1178644) (← links)
- Solving a cutting-stock problem with the constraint logic programming language CHIP (Q1197095) (← links)
- Performance of a neural network method with set partitioning (Q1199894) (← links)
- A complementary greedy heuristic for the knapsack problem (Q1203804) (← links)
- Accelerating Greenberg's method for the computation of knapsack functions (Q1217017) (← links)
- Acyclic orientations of a graph and the chromatic and independence numbers (Q1227749) (← links)
- A note on the total unimodularity of matrices (Q1236586) (← links)