The following pages link to Annals of Operations Research (Q59875):
Displaying 50 items.
- Algebraic modeling for IP and MIP (GAMS) (Q537584) (← links)
- A brief history of lift-and-project (Q537586) (← links)
- Revival of the Gomory cuts in the 1990's (Q537587) (← links)
- Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization (Q537589) (← links)
- Some of my favorite integer programming applications at IBM (Q537591) (← links)
- Branch and bound, integer, and non-integer programming (Q537592) (← links)
- Tabu search -- uncharted domains (Q537593) (← links)
- The atoms of integer programming (Q537595) (← links)
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- What the transportation problem did for me (Q537598) (← links)
- My experiences as a student and researcher in OR during the 1960's and 70's (Q537599) (← links)
- Dual ascent: variations of a theme (Q537601) (← links)
- A survey of the operational use of ILP models (Q537604) (← links)
- Hooked on IP (Q537605) (← links)
- Mixed-integer programming -- 1968 and thereafter (Q537607) (← links)
- Broadening the integer programming audience, the LINDO perspective (Q537610) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- IP over 40+ years at IBM scientific centers and marketing (Q537612) (← links)
- Integer programming in forestry (Q537614) (← links)
- Adaptive memory programming for matrix bandwidth minimization (Q541991) (← links)
- Tabu search approaches for solving the two-group classification problem (Q541993) (← links)
- Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection (Q541996) (← links)
- Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion (Q542000) (← links)
- Hybrid scatter tabu search for unconstrained global optimization (Q542001) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- A GRASP-based approach for technicians and interventions scheduling for telecommunications (Q542005) (← links)
- The case for strategic oscillation (Q542006) (← links)
- Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems (Q545533) (← links)
- New filtering for the cumulative constraint in the context of non-overlapping rectangles (Q545536) (← links)
- Optimal resource allocation and scheduling for the CELL BE platform (Q545538) (← links)
- Domino portrait generation: a fast and scalable approach (Q545542) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- Using local search to speed up filtering algorithms for some NP-hard constraints (Q545546) (← links)
- Haplotype inference with pseudo-Boolean optimization (Q545548) (← links)
- A hybrid constraint programming approach to the log-truck scheduling problem (Q545549) (← links)
- The weighted grammar constraint (Q545550) (← links)
- Leveraging belief propagation, backtrack search, and statistics for model counting (Q545553) (← links)
- An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization (Q545555) (← links)
- Optimal deployment of eventually-serializable data services (Q545558) (← links)
- Global propagation of side constraints for solving over-constrained problems (Q545560) (← links)
- Scheduler -- a system for staff planning (Q596422) (← links)
- A comparison of heuristics for assigning individual employees to labor tour schedules (Q596425) (← links)
- A neural network application in personnel scheduling (Q596426) (← links)
- An implicit tour scheduling model with applications in healthcare (Q596428) (← links)
- Using Benders decomposition to implicitly model tour scheduling (Q596429) (← links)
- An implicit goal programming model for the tour scheduling problem considering the employee work preferences (Q596431) (← links)
- Building better nurse scheduling algorithms (Q596432) (← links)
- Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models (Q596433) (← links)
- Mixed integer programming to schedule a single-shift workforce under annualized hours (Q596436) (← links)
- Planning annualised hours with a finite set of weekly working hours and joint holidays (Q596438) (← links)
