The following pages link to (Q4943600):
Displaying 50 items.
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Logical processing for integer programming (Q817209) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Collaborative emergency berth scheduling based on decentralized decision and price mechanism (Q829200) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- On the copy complexity of width 3 Horn constraint systems (Q831922) (← links)
- Towards global bilevel dynamic optimization (Q842715) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
- Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results (Q849084) (← links)
- A goal programming approach to vehicle routing problems with soft time windows (Q857306) (← links)
- A Benders decomposition algorithm for base station planning problem in WCDMA networks (Q858274) (← links)
- A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
- A military maintenance planning and scheduling problem (Q895774) (← links)
- An optimization approach for planning daily drayage operations (Q926343) (← links)
- Second-order cover inequalities (Q927162) (← links)
- On a posterior evaluation of a simple greedy method for set packing (Q941055) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- An exact method for a discrete multiobjective linear fractional optimization (Q952706) (← links)
- Integer linear programming models for topology optimization in sheet metal design (Q953299) (← links)
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053) (← links)
- Mathematical model for efficient water flow management (Q974575) (← links)
- Complementary column generation and bounding approaches for set partitioning formulations (Q1001332) (← links)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← links)
- Global solution of bilevel programs with a nonconvex inner program (Q1016068) (← links)
- On column generation formulations for the RWA problem (Q1025995) (← links)
- An improved partial enumeration algorithm for integer programming problems (Q1026562) (← links)
- On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs (Q1026920) (← links)
- Optimization of order policies in supply networks (Q1039791) (← links)
- Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm (Q1040789) (← links)
- Polytopes related to the \(l_{\infty}\)-distance between vectors (Q1267189) (← links)
- A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
- A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball (Q1376264) (← links)
- Frequency assignment in mobile radio systems using branch-and-cut techniques (Q1569929) (← links)
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem (Q1628040) (← links)
- Mathematical models for on-line train calendars generation (Q1628108) (← links)
- The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Ambiguous risk constraints with moment and unimodality information (Q1717225) (← links)
- A strengthened mixed-integer linear programming formulation for combined-cycle units (Q1719619) (← links)
- Liner shipping service scheduling and cargo allocation (Q1719622) (← links)
- An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs (Q1734849) (← links)
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) (← links)
- Integer programming approach to static monopolies in graphs (Q1752610) (← links)
- Multi-period stochastic covering location problems: modeling framework and solution approach (Q1754338) (← links)
- Robust multicovers with budgeted uncertainty (Q1755380) (← links)
- Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures (Q1761855) (← links)
