The following pages link to Annals of Operations Research (Q59875):
Displaying 50 items.
- On the convexity of precedence sequencing games (Q816513) (← links)
- Balancedness of sequencing games with multiple parallel machines (Q816514) (← links)
- Implementation of the levels structure value (Q816515) (← links)
- The constrained equal awards rule for bankruptcy problems with a priori unions (Q816516) (← links)
- Condorcet winners for public goods (Q816518) (← links)
- Generalized maximin solutions in multicriteria bargaining (Q816520) (← links)
- Approximations and well-posedness in multicriteria games (Q816521) (← links)
- Conditional viability for impulse differential games (Q816523) (← links)
- Expectation-stock dynamics in multi-agent fisheries (Q816524) (← links)
- Entropic penalties in finite games (Q816527) (← links)
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games (Q816528) (← links)
- A multigenerational game model to analyze sustainable development (Q816529) (← links)
- On the role of the group composition for achieving optimality (Q816530) (← links)
- The egalitarian solution for multichoice games (Q816531) (← links)
- Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis (Q817121) (← links)
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122) (← links)
- Evolutionary approaches to DNA sequencing with errors (Q817123) (← links)
- Real estate appraisal: a double perspective data envelopment analysis approach (Q817126) (← links)
- Multi-decision-makers equalizer: a multiobjective decision support system for multiple decision-makers (Q817129) (← links)
- Multicriteria modelling of repair contract based on utility and ELECTRE I method with dependability and service quality criteria (Q817131) (← links)
- A multi-attribute ranking solutions confirmation procedure (Q817134) (← links)
- A simplex approach for finding local solutions of a linear bilevel program by equilibrium points (Q817135) (← links)
- Scatter search for network design problem (Q817138) (← links)
- Packing \(r\)-cliques in weighted chordal graphs (Q817141) (← links)
- A GA-simplex hybrid algorithm for global minimization of molecular potential energy functions (Q817143) (← links)
- Optimal planning of a multi-station system with sojourn time constraints (Q817147) (← links)
- On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices (Q817149) (← links)
- An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems (Q817152) (← links)
- Papers based on the presentation at the Latin-IBERO-American conference on operations research (CLAIO XI). An international conference of current theory and practice, Concepción, Chile, October 27-31, 2002 (Q817153) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- A mixed-integer programming model for gas purchase and transportation (Q817178) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- Mixed integer linear programming in process scheduling: modeling, algorithms, and applications (Q817182) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- On compact formulations for integer programs solved by column generation (Q817199) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201) (← links)
- Integer-programming software systems (Q817202) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- On a fix-and-relax framework for a class of project scheduling problems (Q817205) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
