The following pages link to (Q5675139):
Displaying 50 items.
- Tight bounds for periodicity theorems on the unbounded knapsack problem (Q421659) (← links)
- Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) (← links)
- Multiple criteria dynamic programming and multiple knapsack problem (Q529961) (← links)
- Some of my favorite integer programming applications at IBM (Q537591) (← links)
- Page cuts for integer interval linear programming (Q754756) (← links)
- A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766) (← links)
- Transmission facility planning in telecommunications networks: A heuristic approach (Q788618) (← links)
- Conjugate duality and the curse of dimensionality (Q811416) (← links)
- Demand point aggregation for planar covering location models (Q816417) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) (← links)
- A polynomial algorithm for solving systems of two linear diophantine equations (Q914391) (← links)
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem (Q941025) (← links)
- Structural analysis of a fractional matching problem (Q967441) (← links)
- Honey bees mating optimization algorithm for large scale vehicle routing problems (Q968387) (← links)
- A hybrid algorithm for the unbounded knapsack problem (Q1013302) (← links)
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) (← links)
- Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← links)
- Unit integer quadratic binary programming (Q1053599) (← links)
- The zero-one knapsack problem with equality constraint (Q1058453) (← links)
- A successful algorithm for the undirected Hamiltonian path problem (Q1061488) (← links)
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
- The reduced cost branch and bound algorithm for mixed integer programming (Q1085067) (← links)
- A heuristic for multiple choice programming (Q1089261) (← links)
- Optimal attribute sets for identifications and diagnoses (Q1090290) (← links)
- Entropy and set covering (Q1092816) (← links)
- Some results and experiments in programming techniques for propositional logic (Q1100931) (← links)
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems (Q1101337) (← links)
- Mathematical optimization and the synchronizing properties of encodings (Q1101414) (← links)
- A finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
- A recursive Lagrangian method for clustering problems (Q1111289) (← links)
- Optimal resolution sequence of problems modelled by directed graphs (Q1112059) (← links)
- A reference direction approach to multiple objective integer linear programming (Q1130044) (← links)
- Implicit enumeration algorithms for the set-partitioning problem (Q1143941) (← links)
- Set partitioning mit linearen Randbedingungen (Q1144493) (← links)
- A matching problem with side conditions (Q1145707) (← links)
- A Lagrangian treatment of certain nonlinear clustering problems (Q1148791) (← links)
- The dynamic set covering problem (Q1167654) (← links)
- Conditional clusters, musters, and probability (Q1169778) (← links)
- Mixed integer minimization models for piecewise-linear functions of a single variable (Q1234631) (← links)
- Static main storage packing problems (Q1241277) (← links)
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074) (← links)
- Discrete right hand side parametrization for linear integer programs (Q1249136) (← links)
- An extension of Hu's group minimization algorithm (Q1254946) (← links)
- Cluster generation and grouping using mathematical programming (Q1255741) (← links)
- Optimal realignments of the teams in the National Football League (Q1268129) (← links)
- Performance optimization of a class of discrete event dynamic systems using calculus of variations techniques (Q1289397) (← links)
- Calculating uncertainty intervals in approximate equation systems (Q1294585) (← links)
- The regional urban solid waste management system: A modelling approach (Q1309980) (← links)
