Pages that link to "Item:Q5650509"
From MaRDI portal
The following pages link to Integer Programming Algorithms: A Framework and State-of-the-Art Survey (Q5650509):
Displayed 50 items.
- Solving capacitated clustering problems (Q799059) (← links)
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type (Q811349) (← links)
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← links)
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem (Q915648) (← links)
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds (Q922953) (← links)
- A branch and bound algorithm for determining locations of long-term care facilities (Q976416) (← links)
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis (Q1048653) (← links)
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (Q1072940) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm (Q1083379) (← links)
- The reduced cost branch and bound algorithm for mixed integer programming (Q1085067) (← links)
- A heuristic for multiple choice programming (Q1089261) (← links)
- On the use of internal rate of return in linear and integer programming (Q1115802) (← links)
- A randomized parallel branch-and-bound algorithm (Q1118396) (← links)
- Experiments in integer programming (Q1137509) (← links)
- Implicit enumeration algorithms for the set-partitioning problem (Q1143941) (← links)
- A classroom/time assignment model (Q1158092) (← links)
- On maintenance scheduling of production units (Q1159562) (← links)
- Parametric integer linear programming: A synthesis of branch and bound with cutting planes (Q1162446) (← links)
- Locational analysis (Q1173002) (← links)
- An algorithm for disjunctive programs (Q1173796) (← links)
- On the calculation of true and pseudo penalties in multiple choice integer programming (Q1183620) (← links)
- Composite stock cutting through simulated annealing (Q1197089) (← links)
- Algorithms for robust single and multiple period layout planning for manufacturing systems (Q1205706) (← links)
- Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung (Q1217449) (← links)
- A procedure for new product positioning in an attribute space (Q1242086) (← links)
- A unified formulation of the machine scheduling problem (Q1245650) (← links)
- A generalisation of variable upper bounding and generalised upper bounding (Q1247367) (← links)
- The 0-1 knapsack problem with multiple choice constraints (Q1248462) (← links)
- An algorithm and efficient data structures for the binary knapsack problem (Q1255893) (← links)
- Cutting-plane theory: Algebraic methods (Q1257827) (← links)
- Computational comparison on the partitioning strategies in multiple choice integer programming (Q1266577) (← links)
- A multiple-tree search procedure for the resource-constrained project scheduling problem (Q1266726) (← links)
- Structural approach to parametric analysis of an IP. On the case of the right-hand side (Q1268242) (← links)
- Modeling uncertainty in networks (Q1310211) (← links)
- Optimizing single-terminal dispatch of large volume trips to trucks (Q1339147) (← links)
- A binary integer linear program with multi-criteria and multi-constraint levels (Q1373885) (← links)
- A one-dimensional cutting stock problem in the aluminium industry and its solution (Q1825753) (← links)
- Solving zero-one multiple objective programs through implicit enumeration (Q1835586) (← links)
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594) (← links)
- Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
- Incumbent solutions in branch-and-bound algorithms: Setting the record straight (Q1915957) (← links)
- A method for convex black-box integer global optimization (Q2045020) (← links)
- Scheduling a project to maximize its net present value: An integer programming approach (Q2366079) (← links)
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds (Q2569064) (← links)
- Using branch-and-bound algorithms to obtain suboptimal solutions (Q3042297) (← links)
- The best parameter subset using the Chebychev curve fitting criterion (Q3662506) (← links)
- Linear complementarity problems solvable by integer programming (Q3798493) (← links)
- A class of problems of optimal net synthesis (Q3798712) (← links)