Pages that link to "Item:Q1296348"

The following pages link to Heuristic algorithms for the portfolio selection problem with minimum transaction lots (Q1296348):

Displaying 40 items.

• A discontinuous mispricing model under asymmetric information (Q319248) (← links)
• Numerical approximations of optimal portfolios in mispriced asymmetric Lévy markets (Q322955) (← links)
• Kernel search: a new heuristic framework for portfolio selection (Q434181) (← links)
• Mean-VaR portfolio selection under real constraints (Q625636) (← links)
• A robust mean absolute deviation model for portfolio optimization (Q632664) (← links)
• Algorithm for cardinality-constrained quadratic optimization (Q842777) (← links)
• Portfolio selection: a linear approach with dual expected utility (Q849753) (← links)
• On the existence of solutions to the quadratic mixed-integer mean-variance portfolio selection problem (Q853084) (← links)
• Portfolio selection under strict uncertainty: a multi-criteria methodology and its application to the Frankfurt and Vienna stock exchanges (Q877641) (← links)
• Extracting from the relaxed for large-scale semi-continuous variable nondominated frontiers (Q905752) (← links)
• A fuzzy interactive approach for optimal portfolio management (Q980516) (← links)
• Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
• Particle swarm optimization approach to portfolio optimization (Q1026729) (← links)
• An MCDM approach to portfolio optimization. (Q1427599) (← links)
• Uncertain portfolio selection with mental accounts and realistic constraints (Q1624618) (← links)
• Multiobjective efficient portfolio selection with bounded parameters (Q1640634) (← links)
• Fuzzy portfolio selection model with real features and different decision behaviors (Q1795117) (← links)
• A mispricing model of stocks under asymmetric information (Q1926893) (← links)
• Portfolio optimization with irreversible long-term investments in renewable energy under policy risk: a mixed-integer multistage stochastic model and a moving-horizon approach (Q2029400) (← links)
• The fractional multidimensional knapsack problem: solution and uniqueness (Q2157286) (← links)
• A new algorithm for quadratic integer programming problems with cardinality constraint (Q2174794) (← links)
• Optimal portfolio selection for the small investor considering risk and transaction costs (Q2267384) (← links)
• Heuristic algorithms for the cardinality constrained efficient frontier (Q2275807) (← links)
• Particle swarm optimization with dynamic random population topology strategies for a generalized portfolio selection problem (Q2311292) (← links)
• On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
• Linear vs. quadratic portfolio selection models with hard real-world constraints (Q2355713) (← links)
• Portfolio-optimization models for small investors (Q2392807) (← links)
• A mixed R{\&}D projects and securities portfolio selection model (Q2455632) (← links)
• Genetic algorithms for portfolio selection problems with minimum transaction lots (Q2456434) (← links)
• Fuzzy portfolio selection using genetic algorithm (Q2466720) (← links)
• Asset portfolio optimization using fuzzy mathematical programming (Q2476800) (← links)
• Conditional value at risk and related linear programming models for portfolio optimization (Q2480247) (← links)
• Twenty years of linear programming based portfolio optimization (Q2514724) (← links)
• On extending the LP computable risk measures to account downside risk (Q2574063) (← links)
• A multi-period fuzzy portfolio optimization model with minimum transaction lots (Q2630242) (← links)
• Benchmarking the performance of portfolio optimization with QAOA (Q2686165) (← links)
• OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION (Q5472778) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• Complex portfolio selection via convex mixed‐integer quadratic programming: a survey (Q6070970) (← links)
• A kernel search matheuristic to solve the discrete leader-follower location problem (Q6195396) (← links)